All classes:
- networkx.lazy_imports.DelayedImportErrorModule
- networkx.exception.NetworkXException
- networkx.exception.NetworkXError
- networkx.exception.NetworkXPointlessConcept
- networkx.exception.NetworkXAlgorithmError
- networkx.exception.NetworkXUnfeasible
- networkx.exception.NetworkXNoPath
- networkx.exception.NetworkXNoCycle
- networkx.exception.HasACycle
- networkx.exception.NetworkXUnbounded
- networkx.exception.NetworkXNotImplemented
- networkx.exception.NodeNotFound
- networkx.exception.AmbiguousSolution
- networkx.exception.ExceededMaxIterations
- networkx.exception.PowerIterationFailedConvergence
- networkx.utils.misc.PythonRandomViaNumpyBits
- networkx.utils.misc.PythonRandomInterface
- networkx.utils.decorators.argmap
- networkx.utils.union_find.UnionFind
- networkx.utils.heaps.MinHeap
- networkx.utils.heaps.MinHeap._Item
- networkx.utils.heaps.PairingHeap
- networkx.utils.heaps.PairingHeap._Node
- networkx.utils.heaps.BinaryHeap
- networkx.utils.configs.Config
- networkx.utils.configs.BackendPriorities
- networkx.utils.backends._dispatchable
- networkx.utils.backends._LazyArgsRepr
- networkx.utils.configs.NetworkXConfig
- networkx.classes.coreviews.AtlasView
- networkx.classes.coreviews.AdjacencyView
- networkx.classes.coreviews.MultiAdjacencyView
- networkx.classes.coreviews.UnionAtlas
- networkx.classes.coreviews.UnionAdjacency
- networkx.classes.coreviews.UnionMultiInner
- networkx.classes.coreviews.UnionMultiAdjacency
- networkx.classes.coreviews.FilterAtlas
- networkx.classes.coreviews.FilterAdjacency
- networkx.classes.coreviews.FilterMultiInner
- networkx.classes.coreviews.FilterMultiAdjacency
- networkx.classes.reportviews.NodeView
- networkx.classes.reportviews.NodeDataView
- networkx.classes.reportviews.DiDegreeView
- networkx.classes.reportviews.DegreeView
- networkx.classes.reportviews.OutDegreeView
- networkx.classes.reportviews.InDegreeView
- networkx.classes.reportviews.MultiDegreeView
- networkx.classes.reportviews.DiMultiDegreeView
- networkx.classes.reportviews.InMultiDegreeView
- networkx.classes.reportviews.OutMultiDegreeView
- networkx.classes.reportviews.EdgeViewABC
- networkx.classes.reportviews.OutEdgeDataView
- networkx.classes.reportviews.EdgeDataView
- networkx.classes.reportviews.InEdgeDataView
- networkx.classes.reportviews.OutMultiEdgeDataView
- networkx.classes.reportviews.MultiEdgeDataView
- networkx.classes.reportviews.InMultiEdgeDataView
- networkx.classes.reportviews.OutEdgeView
- networkx.classes.reportviews.EdgeView
- networkx.classes.reportviews.InEdgeView
- networkx.classes.reportviews.OutMultiEdgeView
- networkx.classes.reportviews.MultiEdgeView
- networkx.classes.reportviews.InMultiEdgeView
- networkx.classes.graph._CachedPropertyResetterAdj
- networkx.classes.graph._CachedPropertyResetterNode
- networkx.classes.graph.Graph
- networkx.classes.digraph._CachedPropertyResetterAdjAndSucc
- networkx.classes.digraph._CachedPropertyResetterPred
- networkx.classes.digraph.DiGraph
- networkx.classes.multigraph.MultiGraph
- networkx.classes.multidigraph.MultiDiGraph
- networkx.classes.filters.show_nodes
- networkx.generators.degree_seq.DegreeSequenceRandomGraph
- networkx.generators.internet_as_graphs.AS_graph_generator
- networkx.algorithms.centrality.flow_matrix.InverseLaplacian
- networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian
- networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian
- networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian
- networkx.algorithms.chordal.NetworkXTreewidthBoundExceeded
- networkx.algorithms.cluster.square_clustering.GAdj
- networkx.algorithms.clique.MaxWeightClique
- networkx.algorithms.coloring.greedy_coloring._Node
- networkx.algorithms.coloring.greedy_coloring._AdjEntry
- networkx.algorithms.cycles._NeighborhoodCache
- networkx.algorithms.matching.max_weight_matching.NoNode
- networkx.algorithms.matching.max_weight_matching.Blossom
- networkx.algorithms.planarity.Interval
- networkx.algorithms.planarity.ConflictPair
- networkx.algorithms.planarity.LRPlanarity
- networkx.algorithms.planarity.PlanarEmbedding
- networkx.algorithms.similarity.optimize_edit_paths.CostMatrix
- networkx.algorithms.simple_paths.PathBuffer
- networkx.algorithms.approximation.kcomponents._AntiGraph
- networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView
- networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView
- networkx.algorithms.approximation.kcomponents._AntiGraph.AntiDegreeView
- networkx.algorithms.tree.mst.EdgePartition
- networkx.algorithms.tree.mst.SpanningTreeIterator
- networkx.algorithms.tree.mst.SpanningTreeIterator.Partition
- networkx.algorithms.tree.branchings.ArborescenceIterator
- networkx.algorithms.tree.branchings.ArborescenceIterator.Partition
- networkx.algorithms.tree.coding.NotATree
- networkx.algorithms.approximation.treewidth.MinDegreeHeuristic
- networkx.algorithms.flow.utils.CurrentEdge
- networkx.algorithms.flow.utils.Level
- networkx.algorithms.flow.utils.GlobalRelabelThreshold
- networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions
- networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph
- networkx.algorithms.community.quality.NotAPartition
- networkx.utils.mapped_queue._HeapElement
- networkx.utils.mapped_queue.MappedQueue
- networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher
- networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher
- networkx.algorithms.isomorphism.isomorphvf2.GMState
- networkx.algorithms.isomorphism.isomorphvf2.DiGMState
- networkx.algorithms.isomorphism.vf2userfunc.GraphMatcher
- networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher
- networkx.algorithms.isomorphism.vf2userfunc.MultiGraphMatcher
- networkx.algorithms.isomorphism.vf2userfunc.MultiDiGraphMatcher
- networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher
- networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher
- networkx.algorithms.isomorphism.ismags.EdgeLookup
- networkx.algorithms.isomorphism.ismags.ISMAGS
- networkx.readwrite.gml.Pattern
- networkx.readwrite.gml.Token
- networkx.readwrite.graphml.GraphML
- networkx.readwrite.graphml.GraphMLWriter
- networkx.readwrite.graphml.IncrementalElement
- networkx.readwrite.graphml.GraphMLWriterLxml
- networkx.readwrite.graphml.GraphMLReader
- networkx.readwrite.gexf.GEXF
- networkx.readwrite.gexf.GEXFWriter
- networkx.readwrite.gexf.GEXFReader
- networkx.readwrite.text.BaseGlyphs
- networkx.readwrite.text.AsciiBaseGlyphs
- networkx.readwrite.text.AsciiDirectedGlyphs
- networkx.readwrite.text.AsciiUndirectedGlyphs
- networkx.readwrite.text.UtfBaseGlyphs
- networkx.readwrite.text.UtfDirectedGlyphs
- networkx.readwrite.text.UtfUndirectedGlyphs
- networkx.readwrite.text.generate_network_text.StackFrame
- networkx.readwrite.text._parse_network_text.ParseStackFrame
- networkx.linalg.algebraicconnectivity._PCGSolver
- networkx.linalg.algebraicconnectivity._LUSolver
- networkx.drawing.nx_pylab.CurvedArrowTextBase
- networkx.drawing.nx_pylab.display.CurvedArrowText
- networkx.drawing.nx_pylab.FancyArrowFactory
- networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory
- networkx.drawing.nx_pylab.draw_networkx_edge_labels.CurvedArrowText
All functions:
  Elements:
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: '...fuzz_graphml'
    functionSourceFile: '...fuzz_graphml'
    functionUses: 0
    functionsReached:
    - atheris.instrument_all
    - '...fuzz_graphml.main'
    - atheris.Fuzz
    - atheris.Setup
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - data
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 21
    functionName: '...fuzz_graphml.TestOneInput'
    functionSourceFile: '...fuzz_graphml'
    functionUses: 0
    functionsReached:
    - io.BytesIO
    - networkx.read_graphml
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: io.BytesIO
    functionSourceFile: io
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.read_graphml
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 33
    functionName: '...fuzz_graphml.main'
    functionSourceFile: '...fuzz_graphml'
    functionUses: 1
    functionsReached:
    - atheris.instrument_all
    - atheris.Fuzz
    - atheris.Setup
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: atheris.instrument_all
    functionSourceFile: atheris
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: atheris.Setup
    functionSourceFile: atheris
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: atheris.Fuzz
    functionSourceFile: atheris
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx
    functionSourceFile: networkx
    functionUses: 0
    functionsReached:
    - utils.backends._set_configs_from_environment
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: utils.backends._set_configs_from_environment
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - name
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 56
    functionName: networkx.__getattr__
    functionSourceFile: networkx
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - AttributeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.drawing
    functionSourceFile: networkx.drawing
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.drawing.nx_agraph
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - collections.deque
    - G.reverse
    - unmatched.append
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - networkx.algorithms.approximation.clique.large_clique_size
    - B_cal_prime.add
    - queue.popleft
    - networkx.algorithms.chordal.chordal_graph_cliques
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - unseen.remove
    - marked.update
    - A.edges
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.utils.open_file
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.int
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.bfs_layers
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.non_edges
    - d.copy
    - networkx.algorithms.smallworld.sigma
    - networkx.classes.reportviews.InEdgeView.__init__
    - G.successors
    - networkx.is_dominating_set
    - length.items
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx._dispatchable
    functionSourceFile: ''
    functionUses: 190
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba443d0>
    - <ast.Constant object at 0x7f734ba44490>
    argNames:
    - G
    - nodes
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 15
    functionName: networkx.algorithms.mis.maximal_independent_set
    functionSourceFile: networkx.algorithms.mis
    functionUses: 190
    functionsReached:
    - indep_nodes.append
    - neighbors.union
    - G.nodes
    - seed.choice
    - <builtin>.list
    - <builtin>.set
    - available_nodes.difference_update
    - set.union
    - nodes.issubset
    - set.intersection
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23790>
    - <ast.Constant object at 0x7f734cc23490>
    argNames:
    - G
    - ebunch
    - alpha
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 243
    functionName: networkx.algorithms.link_prediction.common_neighbor_centrality
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 190
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - networkx.non_edges
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - <builtin>.sum
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.len
    - <builtin>.set
    - networkx.common_neighbors
    - networkx.shortest_path_length
    - <builtin>.float
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - math.log
    - <builtin>.dict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90ca0>
    argNames:
    - G
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 12
    functionName: networkx.algorithms.chains.chain_decomposition
    functionSourceFile: networkx.algorithms.chains
    functionUses: 190
    functionsReached:
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - nodes.append
    - visited.add
    - H.out_edges
    - attr_dict.update
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.list
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.dfs_labeled_edges
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 213
    functionName: networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 190
    functionsReached:
    - G.size
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.cluster._four_cycles
    - G.order
    - networkx.algorithms.bipartite.cluster._threepaths
    - <builtin>.len
    - <builtin>.set
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5f0700>
    argNames:
    - G
    - cutoff
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 176
    functionName: networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 190
    functionsReached:
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.iter
    - <builtin>.dict
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.float
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - walk_length
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.walks.number_of_walks
    functionSourceFile: networkx.algorithms.walks
    functionUses: 190
    functionsReached:
    - networkx.adjacency_matrix
    - <builtin>.enumerate
    - scipy.sparse.linalg.matrix_power
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - S
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 325
    functionName: networkx.algorithms.cuts.node_expansion
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.set
    - G.neighbors
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd277f0>
    argNames:
    - G
    - k
    - cliques
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 9
    functionName: networkx.algorithms.community.kclique.k_clique_communities
    functionSourceFile: networkx.algorithms.community.kclique
    functionUses: 190
    functionsReached:
    - networkx.connected_components
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - adjacent_cliques.add
    - <builtin>.set
    - <builtin>.frozenset
    - networkx.find_cliques
    - <builtin>.iter
    - frozenset.union
    - collections.defaultdict
    - clique.intersection
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24e20>
    argNames:
    - G
    - target
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 117
    functionName: networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 190
    functionsReached:
    - G.is_directed
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.dict
    - <builtin>.len
    - <builtin>.set
    - <builtin>.float
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 8
    IfCount: 9
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7349134850>
    argNames:
    - G
    - length_bound
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 106
    functionName: networkx.algorithms.cycles.simple_cycles
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 190
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - scc_queue.pop
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.cycles._johnson_cycle_search
    - lock.get
    - attr_dict.update
    - scc.add
    - networkx.classes.multigraph.MultiGraph.has_edge
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - queue.pop
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.chain.from_iterable
    - collections.abc.Mapping.attr.items
    - queue.append
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - components.extend
    - networkx.classes.digraph.DiGraph.remove_edge
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - stack.pop
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - Gu.items
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.subgraph
    - visited.intersection
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - blen.append
    - networkx.from_pandas_edgelist
    - blocked.add
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - G.__class__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.components.biconnected.biconnected_components
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - stack.append
    - scc_found.update
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.cycles._bounded_cycle_search
    - path.append
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - edge_stack.append
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - d.popitem
    - scc_queue.append
    - <builtin>.list
    - d.items
    - N.graph.update
    - visited.add
    - networkx.freeze
    - result.graph.update
    - closed.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 227
    functionName: networkx.algorithms.components.strongly_connected.is_strongly_connected
    functionSourceFile: networkx.algorithms.components.strongly_connected
    functionUses: 190
    functionsReached:
    - scc_queue.pop
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - queue.append
    - scc.add
    - scc_found.update
    - scc_queue.append
    - <builtin>.min
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - queue.pop
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f7f0>
    - <ast.Constant object at 0x7f734b06f100>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 229
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_successors
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 190
    functionsReached:
    - collections.defaultdict
    - stack.append
    - visited.add
    - <builtin>.dict
    - <builtin>.len
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8d30>
    argNames:
    - G
    - node1
    - node2
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 128
    functionName: networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    functionSourceFile: networkx.algorithms.lowest_common_ancestors
    functionUses: 190
    functionsReached:
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - itertools.combinations_with_replacement
    - G.successors
    - networkx.is_directed_acyclic_graph
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.len
    - networkx.ancestors
    - <builtin>.set
    - dict.fromkeys
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - start
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 15
    functionName: networkx.algorithms.dominance.immediate_dominators
    functionSourceFile: networkx.algorithms.dominance
    functionUses: 190
    functionsReached:
    - functools.reduce
    - <builtin>.list
    - <builtin>.enumerate
    - order.pop
    - networkx.dfs_postorder_nodes
    - order.reverse
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 7
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - sources
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 465
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 190
    functionsReached:
    - G.is_directed
    - collections.deque.append
    - collections.deque.popleft
    - <builtin>.set
    - depth.items
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 25
    functionName: networkx.algorithms.distance_regular.is_distance_regular
    functionSourceFile: networkx.algorithms.distance_regular
    functionUses: 191
    functionsReached:
    - collections.defaultdict
    - itertools.combinations_with_replacement
    - <builtin>.range
    - cint.get
    - <builtin>.max
    - networkx.algorithms.distance_regular.intersection_array
    - math.log
    - networkx.is_connected
    - <builtin>.sum
    - <builtin>.len
    - bint.get
    - networkx.single_source_shortest_path_length
    - pl_u.update
    - pl_n.update
    - pl_n.items
    - networkx.is_regular
    - pl_u.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 2
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - matching
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 86
    functionName: networkx.algorithms.matching.is_matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 190
    functionsReached:
    - edges.add
    - G.has_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.matching.matching_dict_to_set
    - nodes.update
    - <builtin>.isinstance
    - matching.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 3
    IfCount: 8
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd242e0>
    - <ast.Constant object at 0x7f734cd24e20>
    - <ast.Constant object at 0x7f734cd242b0>
    argNames:
    - G
    - k
    - avail
    - weight
    - partial
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 138
    functionName: networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 190
    functionsReached:
    - T.add_edges_from
    - <builtin>.zip
    - nbrs.items
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - H.subgraph
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - C.nodes
    - collections.abc.Mapping.keys
    - bridge_connectors.add
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - neighbs.intersection
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - H.degree
    - collections.defaultdict
    - avail.keys
    - d.get
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - G.has_edge
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - itertools.combinations
    - G.copy
    - aug_edges.remove
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - networkx.connected_components
    - collections.defaultdict.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - G.number_of_nodes
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - keydict.get
    - keydict.items
    - attr.copy
    - H.remove_edge
    - remaining.difference_update
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.dfs_preorder_nodes
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - T.degree
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - C.edges
    - networkx.dfs_tree
    - G.is_directed
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - aug_edges.append
    - mapping.update
    - <builtin>.iter
    - <builtin>.isinstance
    - avail.values
    - datadict.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.tree_all_pairs_lowest_common_ancestor
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - C.remove_edges_from
    - H.add_edge
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - H.get_edge_data
    - networkx._clear_cache
    - itertools.compress
    - <builtin>.sorted
    - G.graph.update
    - G.__class__
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - C.degree
    - newdict.update
    - networkx.set_node_attributes
    - networkx.edge_connectivity
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - sub_avail.keys
    - <builtin>.tuple
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G2.has_edge
    - math.ceil
    - networkx.has_bridges
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - G.edges
    - itertools.product
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - G.nodes
    - networkx.has_path
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.k_edge_augmentation
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - networkx.empty_graph
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.reverse
    - meta_to_wuv.keys
    - C.add_edges_from
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - <builtin>.map
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - meta_mst.edges
    - C.copy
    - <builtin>.next
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - G2.add_edge
    - only1_adj.items
    - d.popitem
    - networkx.is_k_edge_connected
    - C.add_nodes_from
    - collections.namedtuple
    - <builtin>.list
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - d.copy
    - networkx.freeze
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - A.edges
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 2
    IfCount: 9
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e790>
    argNames:
    - G
    - nodelist
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 131
    functionName: networkx.algorithms.triads.triadic_census
    functionSourceFile: networkx.algorithms.triads
    functionUses: 190
    functionsReached:
    - m.update
    - networkx.algorithms.triads._tricode
    - <builtin>.sum
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - <builtin>.enumerate
    - census.values
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 72
    functionName: networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    functionSourceFile: networkx.algorithms.components.weakly_connected
    functionUses: 190
    functionsReached:
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - seen.update
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - cover
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 110
    functionName: networkx.algorithms.covering.is_edge_cover
    functionSourceFile: networkx.algorithms.covering
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1208
    functionName: networkx.classes.function.is_empty
    functionSourceFile: networkx.classes.function
    functionUses: 191
    functionsReached:
    - <builtin>.any
    - G._adj.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: functools.partial
    functionSourceFile: functools
    functionUses: 254
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 162
    functionName: networkx.algorithms.tree.recognition.is_forest
    functionSourceFile: networkx.algorithms.tree.recognition
    functionUses: 196
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.connected_components
    - collections.abc.Mapping.attr.items
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - <builtin>.isinstance
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.graph.Graph.subgraph
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - c.number_of_edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 99
    functionName: networkx.algorithms.components.biconnected.biconnected_component_edges
    functionSourceFile: networkx.algorithms.components.biconnected
    functionUses: 190
    functionsReached:
    - stack.append
    - visited.add
    - edge_stack.append
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - stack.pop
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.min
    - <builtin>.set
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 8
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7344462100>
    argNames:
    - G
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 28
    functionName: networkx.algorithms.cycles.cycle_basis
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 190
    functionsReached:
    - stack.append
    - gnodes.popitem
    - stack.pop
    - cycles.append
    - <builtin>.set
    - dict.fromkeys
    - cycle.append
    - gnodes.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 95
    functionName: networkx.algorithms.components.connected.number_connected_components
    functionSourceFile: networkx.algorithms.components.connected
    functionUses: 190
    functionsReached:
    - networkx.algorithms.components.connected.connected_components
    - <builtin>.sum
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - seen.update
    - networkx.algorithms.components.connected._plain_bfs
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 16
    functionName: networkx.algorithms.approximation.ramsey.ramsey_R2
    functionSourceFile: networkx.algorithms.approximation.ramsey
    functionUses: 193
    functionsReached:
    - networkx.non_neighbors
    - networkx.utils.arbitrary_element
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - G.subgraph
    - <builtin>.max
    - i_2.add
    - <builtin>.iter
    - <builtin>.set
    - networkx.all_neighbors
    - <builtin>.isinstance
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    - c_1.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 15
    functionName: networkx.algorithms.components.attracting.attracting_components
    functionSourceFile: networkx.algorithms.components.attracting
    functionUses: 192
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.condensation
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd273d0>
    argNames:
    - G
    - source
    - target
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 95
    functionName: networkx.algorithms.simple_paths.all_simple_paths
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 190
    functionsReached:
    - stack.append
    - current_path.values
    - current_path.popitem
    - stack.pop
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.list
    - <builtin>.set
    - G.is_multigraph
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - <builtin>.next
    - current_path.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1338
    functionName: networkx.algorithms.dag.colliders
    functionSourceFile: networkx.algorithms.dag
    functionUses: 191
    functionsReached:
    - G.predecessors
    - itertools.combinations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 7
    functionName: networkx.algorithms.smetric.s_metric
    functionSourceFile: networkx.algorithms.smetric
    functionUses: 190
    functionsReached:
    - G.degree
    - G.edges
    - <builtin>.float
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 59
    functionName: networkx.algorithms.components.attracting.number_attracting_components
    functionSourceFile: networkx.algorithms.components.attracting
    functionUses: 190
    functionsReached:
    - <builtin>.hasattr
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.condensation
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.sum
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65efd0>
    - <ast.Constant object at 0x7f734a65ef10>
    argNames:
    - G
    - nodes
    - mode
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 31
    functionName: networkx.algorithms.bipartite.cluster.latapy_clustering
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 191
    functionsReached:
    - networkx.algorithms.bipartite.is_bipartite
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.bipartite.cluster.cc_dot
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 8
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 38
    functionName: networkx.algorithms.broadcasting.tree_broadcast_center
    functionSourceFile: networkx.algorithms.broadcasting
    functionUses: 191
    functionsReached:
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - <builtin>.sorted
    - W.add
    - values.update
    - <builtin>.enumerate
    - T.degree
    - U.add
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.is_tree
    - W.remove
    - G.neighbors
    - T.neighbors
    - T.remove_nodes_from
    - T.remove_node
    - networkx.utils.arbitrary_element
    - <builtin>.min
    - G.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 112
    functionName: networkx.algorithms.components.weakly_connected.is_weakly_connected
    functionSourceFile: networkx.algorithms.components.weakly_connected
    functionUses: 202
    functionsReached:
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - seen.update
    - <builtin>.next
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 14
    functionName: networkx.algorithms.communicability_alg.communicability
    functionSourceFile: networkx.algorithms.communicability_alg
    functionUses: 190
    functionsReached:
    - numpy.exp
    - <builtin>.range
    - <builtin>.zip
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - numpy.linalg.eigh
    - <builtin>.float
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb556a0>
    argNames:
    - G
    - start_with
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 18
    functionName: networkx.algorithms.dominating.dominating_set
    functionSourceFile: networkx.algorithms.dominating
    functionUses: 190
    functionsReached:
    - remaining_nodes.pop
    - dominating_set.add
    - <builtin>.set
    - networkx.utils.arbitrary_element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a81c0>
    argNames:
    - G
    - source
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 345
    functionName: networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 191
    functionsReached:
    - <builtin>.dict
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - <builtin>.len
    - <builtin>.float
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 123
    functionName: networkx.algorithms.tree.recognition.is_branching
    functionSourceFile: networkx.algorithms.tree.recognition
    functionUses: 195
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.connected_components
    - collections.abc.Mapping.attr.items
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - networkx.algorithms.tree.recognition.is_forest
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - <builtin>.isinstance
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - c.number_of_edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41d90>
    argNames:
    - G
    - top_nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 186
    functionName: networkx.algorithms.bipartite.matching.eppstein_matching
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 190
    functionsReached:
    - networkx.isolates
    - queue.append
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.basic.sets
    - seen.add
    - networkx.algorithms.bipartite.basic.color
    - nextlevel.append
    - layer.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - color.update
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - <builtin>.next
    - newLayer.setdefault
    - <builtin>.hasattr
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - matching.copy
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    - preds.pop
    - networkx.algorithms.components.connected.connected_components
    - unmatched.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - pred.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 83
    functionName: networkx.algorithms.tree.recognition.is_arborescence
    functionSourceFile: networkx.algorithms.tree.recognition
    functionUses: 192
    functionsReached:
    - networkx.algorithms.tree.recognition.is_tree
    - G.number_of_edges
    - networkx.algorithms.components.connected._plain_bfs
    - seen.add
    - nextlevel.append
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - seen.update
    - <builtin>.next
    - G.in_degree
    - G.is_directed
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - source
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.algorithms.dag.ancestors
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - networkx.bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd27fd0>
    argNames:
    - G
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 179
    functionName: networkx.algorithms.link_prediction.adamic_adar_index
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 190
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0f850>
    - <ast.Constant object at 0x7f734cd0f160>
    - <ast.Constant object at 0x7f734cd0f2b0>
    argNames:
    - G
    - nodes
    - cliques
    - separate_nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 521
    functionName: networkx.algorithms.clique.node_clique_number
    functionSourceFile: networkx.algorithms.clique
    functionUses: 190
    functionsReached:
    - collections.defaultdict
    - stack.append
    - ext_u.pop
    - cand.remove
    - networkx.algorithms.clique.find_cliques
    - <builtin>.max
    - stack.pop
    - <builtin>.list
    - <builtin>.len
    - <builtin>.set
    - Q.pop
    - Q.append
    - networkx.ego_graph
    - cand.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 6
    IfCount: 13
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c3fbfd0>
    - <ast.Constant object at 0x7f734c3fbc40>
    argNames:
    - G
    - root
    - pairs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 166
    functionName: networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    functionSourceFile: networkx.algorithms.lowest_common_ancestors
    functionUses: 190
    functionsReached:
    - collections.defaultdict
    - networkx.utils.arbitrary_element
    - <builtin>.sorted
    - <builtin>.iter
    - <builtin>.len
    - networkx.utils.union_find.UnionFind.__init__
    - <builtin>.set
    - <builtin>.str
    - <builtin>.isinstance
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    - networkx.dfs_postorder_nodes
    - networkx.utils.union_find.UnionFind.union
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 282
    functionName: networkx.algorithms.triads.is_triad
    functionSourceFile: networkx.algorithms.triads
    functionUses: 192
    functionsReached:
    - G.nodes
    - G.order
    - <builtin>.isinstance
    - networkx.is_directed
    - G.edges
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc989d0>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 543
    functionName: networkx.algorithms.cluster.square_clustering
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 190
    functionsReached:
    - <builtin>.len
    - two_hop_neighbors.discard
    - G.nbunch_iter
    - set.union
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 5
    IfCount: 8
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf640>
    - <ast.Constant object at 0x7f734a4cfe20>
    argNames:
    - G
    - k
    - max_iter
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 17
    functionName: networkx.algorithms.community.asyn_fluid.asyn_fluidc
    functionSourceFile: networkx.algorithms.community.asyn_fluid
    functionUses: 190
    functionsReached:
    - collections.Counter.keys
    - networkx.utils.misc.groups
    - <builtin>.enumerate
    - networkx.algorithms.components.connected._plain_bfs
    - seen.add
    - nextlevel.append
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - collections.Counter.items
    - <builtin>.next
    - <builtin>.list
    - <builtin>.iter
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - <builtin>.isinstance
    - seed.shuffle
    - collections.Counter
    - collections.defaultdict
    - networkx.algorithms.components.connected.connected_components
    - collections.Counter.values
    - seed.choice
    - <builtin>.dict
    - networkx.classes.graph.Graph.__iter__
    - many_to_one.items
    linkageType: pythonLinkage
    raised:
    - ValueError
    - NetworkXError
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 8
    IfCount: 7
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 456
    functionName: networkx.algorithms.dag.all_topological_sorts
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - G.is_directed
    - collections.deque.append
    - bases.pop
    - current_sort.pop
    - collections.deque.appendleft
    - <builtin>.list
    - <builtin>.dict
    - <builtin>.len
    - current_sort.append
    - collections.deque.pop
    - G.out_edges
    - <builtin>.all
    - G.in_degree
    - collections.deque
    - bases.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 125
    functionName: networkx.algorithms.dag.is_directed_acyclic_graph
    functionSourceFile: networkx.algorithms.dag
    functionUses: 191
    functionsReached:
    - G.is_directed
    - networkx.algorithms.dag.topological_sort
    - networkx.topological_generations
    - networkx.algorithms.dag.has_cycle
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 4
    IfCount: 8
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - matching
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 147
    functionName: networkx.algorithms.matching.is_maximal_matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 190
    functionsReached:
    - edges.add
    - <builtin>.len
    - G.has_edge
    - <builtin>.set
    - networkx.algorithms.matching.matching_dict_to_set
    - nodes.update
    - <builtin>.isinstance
    - matching.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 7
    IfCount: 7
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - num_colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 390
    functionName: networkx.algorithms.coloring.equitable_coloring.equitable_color
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 190
    functionsReached:
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - <builtin>.sorted
    - marked.update
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - collections.defaultdict.keys
    - networkx.complete_graph
    - I_set.add
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - <builtin>.sum
    - A_cal.add
    - <builtin>.enumerate
    - excluded_colors.update
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - G.add_edges_from
    - R_cal.append
    - excluded_colors.union
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - networkx.relabel_nodes
    - I_covered.add
    - <builtin>.next
    - G.degree
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - edges_seen.add
    - next_layer.append
    - <builtin>.list
    - G.neighbors
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - collections.defaultdict
    - F.items
    - <builtin>.range
    - L.keys
    - I_covered.update
    - B_cal_prime.add
    - reachable.extend
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb6370>
    argNames:
    - G
    - nodelist
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 187
    functionName: networkx.convert.to_dict_of_lists
    functionSourceFile: networkx.convert
    functionUses: 190
    functionsReached:
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - S
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 745
    functionName: networkx.algorithms.centrality.group.group_out_degree_centrality
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 190
    functionsReached:
    - G.nodes
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.centrality.group.group_degree_centrality
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f7f0>
    argNames:
    - G
    - target
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 435
    functionName: networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 190
    functionsReached:
    - G.is_directed
    - <builtin>.dict
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - <builtin>.len
    - <builtin>.float
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41730>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 13
    functionName: networkx.algorithms.reciprocity.reciprocity
    functionSourceFile: networkx.algorithms.reciprocity
    functionUses: 190
    functionsReached:
    - G.successors
    - networkx.algorithms.reciprocity._reciprocity_iter
    - G.to_undirected
    - G.number_of_edges
    - <builtin>.dict
    - G.predecessors
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - networkx.algorithms.reciprocity.overall_reciprocity
    - <builtin>.next
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - normalized
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 19
    functionName: networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    functionSourceFile: networkx.algorithms.centrality.subgraph_alg
    functionUses: 190
    functionsReached:
    - expA.diagonal
    - <builtin>.zip
    - scipy.linalg.expm
    - <builtin>.list
    - <builtin>.dict
    - <builtin>.map
    - values.max
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 244
    functionName: networkx.algorithms.dag.topological_sort
    functionSourceFile: networkx.algorithms.dag
    functionUses: 195
    functionsReached:
    - networkx.topological_generations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab167c0>
    argNames:
    - G
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 114
    functionName: networkx.algorithms.link_prediction.jaccard_coefficient
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 190
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 33
    functionName: networkx.algorithms.chordal.is_chordal
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 192
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.graph.Graph.number_of_edges
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.number_of_selfloops
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - unnumbered.remove
    - networkx.algorithms.chordal._max_cardinality_node
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.chordal._find_missing_edge
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.chordal._is_complete_graph
    - <builtin>.iter
    - <builtin>.isinstance
    - missing.pop
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - numbered.add
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - N.graph.update
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - S
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 363
    functionName: networkx.algorithms.cuts.boundary_expansion
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 190
    functionsReached:
    - networkx.node_boundary
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a410640>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 22
    functionName: networkx.algorithms.cluster.triangles
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 190
    functionsReached:
    - collections.Counter
    - later_nbrs.items
    - G.adj.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - <builtin>.sum
    - <builtin>.len
    - collections.Counter.update
    - <builtin>.dict
    - G.nbunch_iter
    - <builtin>.set
    - dict.fromkeys
    - collections.Counter.items
    - <builtin>.next
    - G.adjacency
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55430>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 302
    functionName: networkx.algorithms.clique.find_cliques_recursive
    functionSourceFile: networkx.algorithms.clique
    functionUses: 190
    functionsReached:
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - cand.remove
    - <builtin>.max
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - Q.pop
    - Q.append
    - cand_init.copy
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 186
    functionName: networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    functionSourceFile: networkx.algorithms.components.strongly_connected
    functionUses: 190
    functionsReached:
    - scc_queue.pop
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - scc_found.update
    - queue.append
    - scc.add
    - scc_queue.append
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.iter
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - queue.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1160
    functionName: networkx.algorithms.dag.root_to_leaf_paths
    functionSourceFile: networkx.algorithms.dag
    functionUses: 191
    functionsReached:
    - itertools.chain.from_iterable
    - G.out_degree
    - G.in_degree
    - itertools.product
    - itertools.starmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 6
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Attribute object at 0x7f734cae75e0>
    argNames:
    - G
    - s
    - t
    - treewidth_bound
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 93
    functionName: networkx.algorithms.chordal.find_induced_nodes
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 190
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.graph.Graph.number_of_edges
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - induced_nodes.update
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.number_of_selfloops
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.chordal.is_chordal
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - unnumbered.remove
    - networkx.algorithms.chordal._max_cardinality_node
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.chordal._find_missing_edge
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.chordal._is_complete_graph
    - <builtin>.iter
    - <builtin>.isinstance
    - missing.pop
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - induced_nodes.add
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - numbered.add
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - N.graph.update
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 5
    IfCount: 10
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e040>
    - <ast.Constant object at 0x7f734a65ef10>
    argNames:
    - G
    - source
    - orientation
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 21
    functionName: networkx.algorithms.traversal.edgebfs.edge_bfs
    functionSourceFile: networkx.algorithms.traversal.edgebfs
    functionUses: 190
    functionsReached:
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - visited_nodes.add
    - <builtin>.set
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.frozenset
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - visited_edges.add
    - <builtin>.iter
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - collections.deque
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 3
    IfCount: 9
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab165e0>
    - <ast.Constant object at 0x7f734ab16eb0>
    - <ast.Constant object at 0x7f734ab161c0>
    argNames:
    - G
    - source
    - target
    - cutoff
    - return_seen
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 541
    functionName: networkx.algorithms.shortest_paths.unweighted.predecessor
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 190
    functionsReached:
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5f07c0>
    - <ast.Constant object at 0x7f734b5f02e0>
    argNames:
    - G
    - nbunch
    - flow_func
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 420
    functionName: networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 190
    functionsReached:
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.sum
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - edges.append
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - <builtin>.len
    - <builtin>.set
    - attr.get
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.get
    - G.edges
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 113
    functionName: networkx.algorithms.dag.has_cycle
    functionSourceFile: networkx.algorithms.dag
    functionUses: 193
    functionsReached:
    - networkx.algorithms.dag.topological_sort
    - networkx.topological_generations
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 166
    functionName: networkx.algorithms.dag.topological_generations
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - G.is_directed
    - G.in_degree
    - <builtin>.len
    - G.is_multigraph
    - zero_indegree.append
    - G.neighbors
    linkageType: pythonLinkage
    raised:
    - RuntimeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - coloring
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.coloring.equitable_coloring.is_coloring
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 191
    functionsReached:
    - <builtin>.all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 9
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cadbbb0>
    - <ast.Constant object at 0x7f734cadbb80>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 414
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 190
    functionsReached:
    - stack.append
    - visited.add
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 112
    functionName: networkx.algorithms.community.quality.inter_community_non_edges
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 190
    functionsReached:
    - networkx.complement
    - G.is_directed
    - networkx.classes.graph.Graph.size
    - networkx.classes.digraph.DiGraph.degree
    - networkx.quotient_graph
    - <builtin>.hasattr
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.iter
    - <builtin>.sum
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cae7190>
    argNames:
    - G
    - source
    - value
    - width
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    functionSourceFile: networkx.algorithms.traversal.beamsearch
    functionUses: 190
    functionsReached:
    - networkx.generic_bfs_edges
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 7
    IfCount: 10
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcbac0>
    - <ast.Constant object at 0x7f734d8d3730>
    argNames:
    - G
    - source
    - orientation
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 19
    functionName: networkx.algorithms.traversal.edgedfs.edge_dfs
    functionSourceFile: networkx.algorithms.traversal.edgedfs
    functionUses: 190
    functionsReached:
    - G.is_directed
    - stack.append
    - G.in_edges
    - visited_nodes.add
    - stack.pop
    - <builtin>.list
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - visited_edges.add
    - <builtin>.iter
    - G.nbunch_iter
    - <builtin>.set
    - <builtin>.next
    - G.is_multigraph
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - <builtin>.frozenset
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 109
    functionName: networkx.algorithms.tournament.hamiltonian_path
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 190
    functionsReached:
    - networkx.algorithms.tournament.index_satisfying
    - networkx.utils.arbitrary_element
    - G.subgraph
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - <builtin>.enumerate
    - networkx.algorithms.tournament.hamiltonian_path
    - <builtin>.isinstance
    - hampath.insert
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - source
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 22
    functionName: networkx.algorithms.shortest_paths.generic.has_path
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 190
    functionsReached:
    - networkx.shortest_path
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 9
    IfCount: 8
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7343618a90>
    - <ast.Constant object at 0x7f7343618ac0>
    - <ast.Constant object at 0x7f7343618af0>
    argNames:
    - G
    - k
    - avail
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 1163
    functionName: networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 191
    functionsReached:
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - G.number_of_nodes
    - <builtin>.sum
    - nbrs.items
    - attr.copy
    - newdict.update
    - networkx.maximum_flow_value
    - <builtin>.map
    - H.remove_edge
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.edge_connectivity
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx._clear_cache
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - G.is_directed
    - rng.shuffle
    - <builtin>.hasattr
    - aug_edges.append
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - H.degree
    - avail.values
    - networkx.has_bridges
    - avail.keys
    - G.nodes
    - networkx.has_path
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - networkx.classes.digraph.DiGraph.is_directed
    - H.add_edge
    - G.has_edge
    - G.copy
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - aug_edges.remove
    - itertools.compress
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 21
    functionName: networkx.algorithms.matching.maximal_matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 191
    functionsReached:
    - matching.add
    - <builtin>.set
    - G.edges
    - nodes.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd419a0>
    argNames:
    - G
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 85
    functionName: networkx.algorithms.bridges.has_bridges
    functionSourceFile: networkx.algorithms.bridges
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - networkx.chain_decomposition
    - networkx.node_connected_component
    - <builtin>.len
    - networkx.algorithms.bridges.bridges
    - <builtin>.set
    - G.is_multigraph
    - H.subgraph
    - <builtin>.next
    - H.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - start
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 95
    functionName: networkx.algorithms.dominance.dominance_frontiers
    functionSourceFile: networkx.algorithms.dominance
    functionUses: 190
    functionsReached:
    - networkx.immediate_dominators
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65edf0>
    argNames:
    - G
    - iterations
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 217
    functionName: networkx.algorithms.approximation.density.densest_subgraph
    functionSourceFile: networkx.algorithms.approximation.density
    functionUses: 190
    functionsReached:
    - heapq.heappop
    - G.number_of_nodes
    - G.number_of_edges
    - remaining_nodes.remove
    - <builtin>.enumerate
    - numpy.empty
    - numpy.full
    - networkx.algorithms.approximation.density._fista
    - math.sqrt
    - numpy.clip
    - networkx.algorithms.approximation.density._fractional_peeling
    - <builtin>.max
    - numpy.array
    - <builtin>.len
    - numpy.add.at
    - <builtin>.set
    - <builtin>.next
    - networkx.utils.heaps.BinaryHeap.pop
    - x.copy
    - networkx.utils.heaps.BinaryHeap.insert
    - heapq.heappush
    - G.neighbors
    - <builtin>.range
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 408
    functionName: networkx.algorithms.threshold.find_creation_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 191
    functionsReached:
    - cs.reverse
    - ds.sort
    - cs.extend
    - <builtin>.zip
    - H.order
    - <builtin>.dict
    - <builtin>.len
    - H.neighbors
    - H.subgraph
    - dsdict.items
    - ds.pop
    - H.degree
    - cs.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcbfd0>
    argNames:
    - G
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.bridges.bridges
    functionSourceFile: networkx.algorithms.bridges
    functionUses: 191
    functionsReached:
    - itertools.chain.from_iterable
    - networkx.chain_decomposition
    - networkx.node_connected_component
    - <builtin>.len
    - <builtin>.set
    - G.is_multigraph
    - H.subgraph
    - H.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d6114f0>
    - <ast.Constant object at 0x7f734d611430>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 266
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 190
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - <builtin>.sorted
    - seen.add
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.neighbors
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 575
    functionName: networkx.algorithms.dag.is_aperiodic
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - G.is_directed
    - next_level.append
    - networkx.utils.arbitrary_element
    - math.gcd
    - networkx.is_strongly_connected
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.isinstance
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf3a0>
    - <ast.Constant object at 0x7f734a4cfcd0>
    - <ast.Constant object at 0x7f734a4cf580>
    argNames:
    - G
    - niter
    - nrand
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 319
    functionName: networkx.algorithms.smallworld.omega
    functionSourceFile: networkx.algorithms.smallworld
    functionUses: 190
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - numpy.append
    - networkx.maximum_flow_value
    - networkx.number_of_edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.index
    - numpy.ceil
    - numpy.where
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.algorithms.smallworld.lattice_reference
    - <builtin>.len
    - numpy.mean
    - <builtin>.hasattr
    - networkx.algorithms.smallworld.random_reference
    - G.add_edge
    - networkx.average_shortest_path_length
    - G.remove_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - bisect.bisect_left
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - numpy.arange
    - G.neighbors
    - <builtin>.range
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - seed.choice
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - G.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.average_clustering
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35e3d0>
    - <ast.Constant object at 0x7f734c35e970>
    - <ast.Constant object at 0x7f734ba80190>
    argNames:
    - G
    - normalized
    - Q
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 14
    functionName: networkx.algorithms.richclub.rich_club_coefficient
    functionSourceFile: networkx.algorithms.richclub
    functionUses: 190
    functionsReached:
    - R.number_of_edges
    - <builtin>.sorted
    - networkx.algorithms.richclub._compute_rc
    - networkx.double_edge_swap
    - networkx.degree_histogram
    - edge_degrees.pop
    - itertools.accumulate
    - <builtin>.sum
    - G.copy
    - <builtin>.len
    - G.number_of_edges
    - networkx.number_of_selfloops
    - <builtin>.enumerate
    - <builtin>.map
    - rc.items
    - G.edges
    linkageType: pythonLinkage
    raised:
    - Exception
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 89
    functionName: networkx.algorithms.asteroidal.is_at_free
    functionSourceFile: networkx.algorithms.asteroidal
    functionUses: 190
    functionsReached:
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - networkx.connected_components
    - G.subgraph
    - networkx.non_edges
    - <builtin>.len
    - <builtin>.set
    - u_neighborhood.union
    - networkx.algorithms.asteroidal.create_component_structure
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 96
    functionName: networkx.algorithms.communicability_alg.communicability_exp
    functionSourceFile: networkx.algorithms.communicability_alg
    functionUses: 190
    functionsReached:
    - <builtin>.range
    - <builtin>.zip
    - scipy.linalg.expm
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.float
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7347d4f2b0>
    - <ast.Constant object at 0x7f7347d4f280>
    - <ast.Constant object at 0x7f7347d4f250>
    - <ast.Constant object at 0x7f7347d4f220>
    - <ast.Constant object at 0x7f7347d4f1f0>
    argNames:
    - G
    - source
    - target
    - importance_factor
    - max_iterations
    - tolerance
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1199
    functionName: networkx.algorithms.similarity.simrank_similarity
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 190
    functionsReached:
    - <builtin>.range
    - <builtin>.zip
    - nodelist.index
    - numpy.array
    - <builtin>.list
    - numpy.fill_diagonal
    - <builtin>.dict
    - <builtin>.len
    - adjacency_matrix.sum
    - x.tolist
    - numpy.allclose
    - <builtin>.float
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - numpy.eye
    - networkx.to_numpy_array
    - newsim.copy
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 215
    functionName: networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.subgraph_alg
    functionUses: 190
    functionsReached:
    - <builtin>.range
    - numpy.diag
    - <builtin>.float
    - numpy.nonzero
    - B.sum
    - <builtin>.zip
    - scipy.linalg.expm
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - cbc.items
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 35
    functionName: networkx.algorithms.polynomials.tutte_polynomial
    functionSourceFile: networkx.algorithms.polynomials
    functionUses: 190
    functionsReached:
    - networkx.contracted_edge
    - C.remove_edge
    - collections.deque.append
    - sympy.Symbol
    - G.remove_edge
    - <builtin>.list
    - <builtin>.len
    - collections.deque.pop
    - <builtin>.set
    - networkx.selfloop_edges
    - sympy.simplify
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55580>
    - <ast.Constant object at 0x7f734bb55820>
    - <ast.Constant object at 0x7f734bb55130>
    argNames:
    - G
    - s
    - t
    - flow_func
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 210
    functionName: networkx.algorithms.connectivity.connectivity.node_connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.sum
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - edges.append
    - networkx.is_connected
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - G.predecessors
    - <builtin>.len
    - operator.itemgetter
    - <builtin>.set
    - attr.get
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.is_weakly_connected
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.get
    - G.edges
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - G.successors
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 154
    functionName: networkx.algorithms.components.connected.is_connected
    functionSourceFile: networkx.algorithms.components.connected
    functionUses: 203
    functionsReached:
    - networkx.algorithms.components.connected.connected_components
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.components.connected._plain_bfs
    - <builtin>.next
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 11
    functionName: networkx.algorithms.components.semiconnected.is_semiconnected
    functionSourceFile: networkx.algorithms.components.semiconnected
    functionUses: 190
    functionsReached:
    - itertools.pairwise
    - networkx.topological_sort
    - networkx.condensation
    - <builtin>.zip
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.len
    - networkx.is_weakly_connected
    - itertools.tee
    - <builtin>.all
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.utils.misc.pairwise
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 62
    functionName: networkx.algorithms.community.quality.intra_community_edges
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 190
    functionsReached:
    - G.subgraph
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 81
    functionName: networkx.algorithms.reciprocity.overall_reciprocity
    functionSourceFile: networkx.algorithms.reciprocity
    functionUses: 191
    functionsReached:
    - G.to_undirected
    - G.number_of_edges
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 265
    functionName: networkx.algorithms.tournament.is_reachable
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 191
    functionsReached:
    - G._pred.items
    - networkx.algorithms.tournament.is_reachable.is_closed
    - <builtin>.all
    - G._adj.items
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 22
    functionName: networkx.algorithms.euler.is_eulerian
    functionSourceFile: networkx.algorithms.euler
    functionUses: 194
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.is_strongly_connected
    - <builtin>.all
    - networkx.is_connected
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 134
    functionName: networkx.algorithms.approximation.clique.clique_removal
    functionSourceFile: networkx.algorithms.approximation.clique
    functionUses: 192
    functionsReached:
    - graph.remove_nodes_from
    - networkx.non_neighbors
    - networkx.utils.arbitrary_element
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - G.subgraph
    - isets.append
    - <builtin>.max
    - i_2.add
    - <builtin>.iter
    - G.copy
    - <builtin>.set
    - networkx.all_neighbors
    - <builtin>.isinstance
    - cliques.append
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    - c_1.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 18
    functionName: networkx.algorithms.components.biconnected.is_biconnected
    functionSourceFile: networkx.algorithms.components.biconnected
    functionUses: 190
    functionsReached:
    - stack.append
    - itertools.chain.from_iterable
    - visited.add
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - <builtin>.min
    - <builtin>.iter
    - <builtin>.len
    - edge_stack.append
    - <builtin>.set
    - stack.pop
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 7
    IfCount: 8
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16ac0>
    - <ast.Constant object at 0x7f734ab168e0>
    argNames:
    - G
    - source
    - keys
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 335
    functionName: networkx.algorithms.euler.eulerian_path
    functionSourceFile: networkx.algorithms.euler
    functionUses: 190
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - networkx.is_strongly_connected
    - networkx.classes.digraph.DiGraph.remove_edge
    - vertex_stack.pop
    - <builtin>.all
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.reversed
    - vertex_stack.append
    - networkx.is_connected
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.is_eulerian
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - G.in_degree
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - d.popitem
    - G.out_degree
    - G.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.is_weakly_connected
    - <builtin>.list
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - G.is_multigraph
    - networkx.algorithms.euler.is_eulerian
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.utils.misc.arbitrary_element
    - networkx.classes.digraph.DiGraph.out_edges
    - G.reverse
    - networkx.utils.arbitrary_element
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - G.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.euler._find_path_start
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - G.degree
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 191
    functionName: networkx.algorithms.tournament.score_sequence
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 190
    functionsReached:
    - <builtin>.sorted
    - G.out_degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb1c0>
    argNames:
    - G
    - flow_func
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 351
    functionName: networkx.algorithms.connectivity.connectivity.average_node_connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 190
    functionsReached:
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.sum
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - edges.append
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - <builtin>.len
    - attr.get
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.get
    - G.edges
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccffca0>
    - <ast.Constant object at 0x7f734ccff940>
    argNames:
    - G
    - avail
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 447
    functionName: networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 191
    functionsReached:
    - T.add_edges_from
    - <builtin>.zip
    - nbrs.items
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - C.nodes
    - collections.abc.Mapping.keys
    - bridge_connectors.add
    - remaining.issuperset
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - collections.defaultdict
    - avail.keys
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.has_edge
    - G.copy
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.connected_components
    - collections.defaultdict.items
    - G.number_of_nodes
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - keydict.get
    - keydict.items
    - remaining.difference_update
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.dfs_preorder_nodes
    - T.degree
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.dfs_tree
    - networkx.minimum_spanning_arborescence
    - mapping.update
    - <builtin>.iter
    - <builtin>.isinstance
    - avail.values
    - datadict.copy
    - networkx.tree_all_pairs_lowest_common_ancestor
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - itertools.compress
    - <builtin>.sorted
    - G.graph.update
    - G.__class__
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - C.degree
    - networkx.set_node_attributes
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.tuple
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G2.has_edge
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - math.ceil
    - networkx.has_bridges
    - itertools.product
    - G.edges
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - G.nodes
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.reverse
    - meta_to_wuv.keys
    - C.add_edges_from
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - <builtin>.enumerate
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - C.copy
    - meta_mst.edges
    - <builtin>.next
    - G2.add_edge
    - d.popitem
    - C.add_nodes_from
    - collections.namedtuple
    - <builtin>.list
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - d.copy
    - networkx.freeze
    - networkx.set_edge_attributes
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - A.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77aa00>
    argNames:
    - G
    - source
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 116
    functionName: networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    functionSourceFile: networkx.algorithms.components.strongly_connected
    functionUses: 190
    functionsReached:
    - stack.append
    - G.reverse
    - post.pop
    - stack.pop
    - <builtin>.list
    - <builtin>.len
    - <builtin>.set
    - new.add
    - seen.add
    - networkx.dfs_postorder_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 90
    functionName: networkx.algorithms.isolate.number_of_isolates
    functionSourceFile: networkx.algorithms.isolate
    functionUses: 190
    functionsReached:
    - G.degree
    - networkx.algorithms.isolate.isolates
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 47
    functionName: networkx.algorithms.core.core_number
    functionSourceFile: networkx.algorithms.core
    functionUses: 195
    functionsReached:
    - <builtin>.sorted
    - <builtin>.list
    - <builtin>.dict
    - bin_boundaries.extend
    - networkx.all_neighbors
    - networkx.number_of_selfloops
    - <builtin>.enumerate
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 265
    functionName: networkx.algorithms.components.biconnected.articulation_points
    functionSourceFile: networkx.algorithms.components.biconnected
    functionUses: 190
    functionsReached:
    - stack.append
    - visited.add
    - edge_stack.append
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - stack.pop
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.min
    - <builtin>.set
    - <builtin>.next
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 70
    functionName: networkx.algorithms.tournament.is_tournament
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 190
    functionsReached:
    - <builtin>.all
    - itertools.combinations
    - networkx.number_of_selfloops
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 114
    functionName: networkx.algorithms.bipartite.basic.is_bipartite_node_set
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 190
    functionsReached:
    - networkx.isolates
    - queue.append
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.basic.sets
    - Y.issubset
    - seen.add
    - networkx.algorithms.bipartite.basic.color
    - nextlevel.append
    - Y.isdisjoint
    - color.update
    - G.subgraph
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - X.issubset
    - <builtin>.next
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    - networkx.algorithms.components.connected.connected_components
    - X.isdisjoint
    - networkx.classes.digraph.DiGraph.is_directed
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised:
    - AmbiguousSolution
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26550>
    - <ast.Constant object at 0x7f734cf26730>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 355
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 190
    functionsReached:
    - networkx.dfs_labeled_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.efficiency_measures.efficiency
    functionSourceFile: networkx.algorithms.efficiency_measures
    functionUses: 190
    functionsReached:
    - networkx.shortest_path_length
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 213
    functionName: networkx.algorithms.components.connected.node_connected_component
    functionSourceFile: networkx.algorithms.components.connected
    functionUses: 190
    functionsReached:
    - <builtin>.len
    - seen.add
    - networkx.algorithms.components.connected._plain_bfs
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - normalized
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 114
    functionName: networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    functionSourceFile: networkx.algorithms.centrality.subgraph_alg
    functionUses: 191
    functionsReached:
    - numpy.exp
    - numpy.nonzero
    - <builtin>.zip
    - numpy.array
    - <builtin>.list
    - <builtin>.dict
    - numpy.linalg.eigh
    - <builtin>.map
    - w.max
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 222
    functionName: networkx.algorithms.distance_regular.is_strongly_regular
    functionSourceFile: networkx.algorithms.distance_regular
    functionUses: 190
    functionsReached:
    - <builtin>.sum
    - dist.values
    - pl_n.update
    - networkx.is_regular
    - networkx.single_source_shortest_path_length
    - pl_u.items
    - itertools.combinations_with_replacement
    - ruled_out.update
    - networkx.algorithms.distance_regular.is_distance_regular
    - <builtin>.max
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.is_connected
    - <builtin>.len
    - e.values
    - <builtin>.set
    - G.is_directed
    - networkx.shortest_path_length
    - cint.get
    - G.order
    - bint.get
    - networkx.algorithms.distance_measures.diameter
    - length.values
    - pl_n.items
    - pl_u.update
    - networkx.algorithms.distance_measures._extrema_bounding
    - collections.defaultdict
    - <builtin>.range
    - networkx.algorithms.distance_measures.eccentricity
    - math.log
    - <builtin>.min
    - <builtin>.dict
    - G.nbunch_iter
    - dict.fromkeys
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - z
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 835
    functionName: networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 192
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.contracted_edge
    - <builtin>.hasattr
    - math.exp
    - <builtin>.round
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - math.log
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.len
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - networkx.number_of_spanning_trees
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 18
    functionName: networkx.algorithms.approximation.matching.min_maximal_matching
    functionSourceFile: networkx.algorithms.approximation.matching
    functionUses: 190
    functionsReached:
    - networkx.maximal_matching
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 7
    IfCount: 7
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 17
    functionName: networkx.algorithms.components.strongly_connected.strongly_connected_components
    functionSourceFile: networkx.algorithms.components.strongly_connected
    functionUses: 195
    functionsReached:
    - scc_queue.pop
    - queue.append
    - scc.add
    - scc_found.update
    - scc_queue.append
    - <builtin>.min
    - <builtin>.iter
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - queue.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 219
    functionName: networkx.algorithms.tree.recognition.is_tree
    functionSourceFile: networkx.algorithms.tree.recognition
    functionUses: 193
    functionsReached:
    - G.is_directed
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - G.number_of_edges
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - <builtin>.len
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - <builtin>.set
    - seen.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.components.connected._plain_bfs
    - <builtin>.next
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb6610>
    argNames:
    - G
    - pairs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 19
    functionName: networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    functionSourceFile: networkx.algorithms.lowest_common_ancestors
    functionUses: 191
    functionsReached:
    - itertools.combinations_with_replacement
    - G.successors
    - networkx.is_directed_acyclic_graph
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - <builtin>.iter
    - <builtin>.len
    - networkx.ancestors
    - <builtin>.set
    - dict.fromkeys
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64b6d0>
    - <ast.Constant object at 0x7f734d64bdf0>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 167
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 190
    functionsReached:
    - stack.append
    - visited.add
    - <builtin>.len
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7341ca2970>
    argNames:
    - G
    - source
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 22
    functionName: networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 198
    functionsReached:
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.dict
    - <builtin>.len
    - <builtin>.set
    - <builtin>.float
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 10
    functionName: networkx.algorithms.centrality.degree_alg.degree_centrality
    functionSourceFile: networkx.algorithms.centrality.degree_alg
    functionUses: 190
    functionsReached:
    - <builtin>.len
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba160>
    argNames:
    - G
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 113
    functionName: networkx.algorithms.broadcasting.tree_broadcast_time
    functionSourceFile: networkx.algorithms.broadcasting
    functionUses: 190
    functionsReached:
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - <builtin>.sorted
    - W.add
    - <builtin>.sum
    - values.update
    - <builtin>.enumerate
    - T.degree
    - U.add
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - networkx.is_tree
    - W.remove
    - G.neighbors
    - T.neighbors
    - T.remove_nodes_from
    - T.remove_node
    - networkx.utils.arbitrary_element
    - <builtin>.min
    - G.copy
    - networkx.bfs_layers
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - S
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 646
    functionName: networkx.algorithms.centrality.group.group_degree_centrality
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 192
    functionsReached:
    - G.neighbors
    - <builtin>.len
    - G.nodes
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 7
    IfCount: 10
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - x
    - y
    - z
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 231
    functionName: networkx.algorithms.d_separation.is_d_separator
    functionSourceFile: networkx.algorithms.d_separation
    functionUses: 190
    functionsReached:
    - backward_visited.add
    - forward_visited.add
    - networkx.is_directed_acyclic_graph
    - collections.deque.popleft
    - networkx.ancestors
    - <builtin>.set
    - collections.deque.extend
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.algorithms.dominating.is_dominating_set
    functionSourceFile: networkx.algorithms.dominating
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.set
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 123
    functionName: networkx.algorithms.asteroidal.create_component_structure
    functionSourceFile: networkx.algorithms.asteroidal
    functionUses: 192
    functionsReached:
    - networkx.connected_components
    - <builtin>.set
    - G.subgraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1117
    functionName: networkx.algorithms.connectivity.edge_augmentation.complement_edges
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - G.is_directed
    - itertools.combinations
    - G.nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d612dc0>
    argNames:
    - G
    - cutoff
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 494
    functionName: networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 190
    functionsReached:
    - <builtin>.dict
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - <builtin>.len
    - <builtin>.float
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - source
    - distance
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 540
    functionName: networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 190
    functionsReached:
    - <builtin>.set
    - <builtin>.enumerate
    - networkx.bfs_layers
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcb430>
    argNames:
    - G
    - k
    - l
    - low_memory
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 120
    functionName: networkx.algorithms.hybrid.is_kl_connected
    functionSourceFile: networkx.algorithms.hybrid
    functionUses: 190
    functionsReached:
    - <builtin>.range
    - G.subgraph
    - verts.copy
    - G.edges
    - verts.update
    - G2.remove_edge
    - copy.deepcopy
    - networkx.shortest_path
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 80
    functionName: networkx.algorithms.community.quality.inter_community_edges
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 191
    functionsReached:
    - G.is_directed
    - networkx.classes.graph.Graph.size
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.quotient_graph
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.iter
    - <builtin>.sum
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - source
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 227
    functionName: networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 190
    functionsReached:
    - path.append
    - networkx.classes.digraph.DiGraph.is_directed
    - path.reverse
    - <builtin>.len
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - reverse_fringe.append
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - source
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 39
    functionName: networkx.algorithms.dag.descendants
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - networkx.bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 2
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - matching
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 209
    functionName: networkx.algorithms.matching.is_perfect_matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 190
    functionsReached:
    - edges.add
    - G.has_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.matching.matching_dict_to_set
    - nodes.update
    - <builtin>.isinstance
    - matching.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 172
    functionName: networkx.algorithms.components.biconnected.biconnected_components
    functionSourceFile: networkx.algorithms.components.biconnected
    functionUses: 195
    functionsReached:
    - stack.append
    - itertools.chain.from_iterable
    - visited.add
    - edge_stack.append
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - stack.pop
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.min
    - <builtin>.set
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 28
    functionName: networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 191
    functionsReached:
    - networkx.connected_components
    - networkx.minimum_cut
    - G.__class__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.get
    - networkx.utils.decorators.argmap.__init__
    - H.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - H.nodes
    - G.is_directed
    - H.is_directed
    - H.remove_edges_from
    - avail.intersection
    - <builtin>.iter
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - aux_graph.k_edge_components
    - H.add_nodes_from
    - <builtin>.isinstance
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - G.nodes
    - G.copy
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.strongly_connected_components
    - networkx.utils.decorators.not_implemented_for
    - H.number_of_nodes
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 494
    functionName: networkx.algorithms.core.onion_layers
    functionSourceFile: networkx.algorithms.core
    functionUses: 190
    functionsReached:
    - <builtin>.sorted
    - networkx.isolates
    - this_layer.append
    - <builtin>.list
    - <builtin>.dict
    - <builtin>.len
    - networkx.all_neighbors
    - networkx.number_of_selfloops
    - G.degree
    - degrees.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d38c6d0>
    - <ast.Constant object at 0x7f734d38c6a0>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 19
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_edges
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 196
    functionsReached:
    - stack.append
    - <builtin>.len
    - <builtin>.set
    - visited.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.algorithms.isolate.is_isolate
    functionSourceFile: networkx.algorithms.isolate
    functionUses: 190
    functionsReached:
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8a90>
    argNames:
    - G
    - k
    - avail
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 289
    functionName: networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 191
    functionsReached:
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - <builtin>.zip
    - H.add_edges_from
    - H.subgraph
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - <builtin>.len
    - <builtin>.set
    - C.edges
    - sub_avail.keys
    - only1_adj.items
    - networkx.k_edge_subgraphs
    - <builtin>.list
    - neighbs.intersection
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - <builtin>.isinstance
    - avail.values
    - avail.keys
    - d.get
    - C.remove_edges_from
    - G.has_edge
    - G.copy
    - networkx.k_edge_augmentation
    - itertools.combinations
    - H.get_edge_data
    - itertools.compress
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 1
    IfCount: 10
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e340>
    - <ast.Constant object at 0x7f734c43e760>
    - <ast.Constant object at 0x7f734c43e790>
    - <ast.Constant object at 0x7f734c43e9d0>
    argNames:
    - G
    - s
    - t
    - flow_func
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 647
    functionName: networkx.algorithms.connectivity.connectivity.edge_connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 190
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - nbrs.items
    - networkx.maximum_flow_value
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.dominating_set
    - networkx.is_connected
    - <builtin>.len
    - attr.get
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - <builtin>.hasattr
    - D.pop
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.is_weakly_connected
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 31
    functionName: networkx.algorithms.clique.enumerate_all_cliques
    functionSourceFile: networkx.algorithms.clique
    functionUses: 190
    functionsReached:
    - collections.deque.append
    - <builtin>.sorted
    - <builtin>.map
    - <builtin>.len
    - collections.deque.popleft
    - <builtin>.enumerate
    - <builtin>.filter
    - itertools.islice
    - itertools.chain
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - sources
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 406
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_layers
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 190
    functionsReached:
    - next_layer.append
    - <builtin>.set
    - visited.add
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 316
    functionName: networkx.algorithms.centrality.subgraph_alg.estrada_index
    functionSourceFile: networkx.algorithms.centrality.subgraph_alg
    functionUses: 190
    functionsReached:
    - numpy.exp
    - numpy.nonzero
    - <builtin>.zip
    - numpy.array
    - <builtin>.sum
    - <builtin>.list
    - <builtin>.dict
    - numpy.linalg.eigh
    - <builtin>.map
    - w.max
    - networkx.to_numpy_array
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb4c0>
    - <ast.Constant object at 0x7f734ccfb430>
    - <ast.Constant object at 0x7f734ccfbd30>
    argNames:
    - G
    - source
    - reverse
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 109
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_edges
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 196
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - <builtin>.sorted
    - seen.add
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.neighbors
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a413970>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 671
    functionName: networkx.algorithms.cluster.generalized_degree
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 190
    functionsReached:
    - G.adj.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - <builtin>.sum
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - collections.Counter.items
    - <builtin>.next
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 23
    functionName: networkx.algorithms.asteroidal.find_asteroidal_triple
    functionSourceFile: networkx.algorithms.asteroidal
    functionUses: 191
    functionsReached:
    - networkx.connected_components
    - G.subgraph
    - networkx.non_edges
    - <builtin>.len
    - <builtin>.set
    - u_neighborhood.union
    - networkx.algorithms.asteroidal.create_component_structure
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23e20>
    argNames:
    - G
    - matching
    - top_nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 425
    functionName: networkx.algorithms.bipartite.matching.to_vertex_cover
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 190
    functionsReached:
    - networkx.isolates
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - queue.append
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - networkx.algorithms.bipartite.basic.sets
    - seen.add
    - networkx.algorithms.bipartite.basic.color
    - nextlevel.append
    - color.update
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - <builtin>.next
    - matching.items
    - <builtin>.frozenset
    - stack.append
    - <builtin>.tuple
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    - G.edges
    - visited.add
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.classes.digraph.DiGraph.is_directed
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6913d0>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 12
    functionName: networkx.algorithms.bipartite.redundancy.node_redundancy
    functionSourceFile: networkx.algorithms.bipartite.redundancy
    functionUses: 190
    functionsReached:
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - <builtin>.sum
    - <builtin>.len
    - itertools.combinations
    - <builtin>.set
    - <builtin>.any
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 49
    functionName: networkx.algorithms.regular.is_k_regular
    functionSourceFile: networkx.algorithms.regular
    functionUses: 190
    functionsReached:
    - <builtin>.all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 1
    IfCount: 12
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - x
    - y
    - z
    - included
    - restricted
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 446
    functionName: networkx.algorithms.d_separation.is_minimal_d_separator
    functionSourceFile: networkx.algorithms.d_separation
    functionUses: 190
    functionsReached:
    - collections.deque.append
    - networkx.is_directed_acyclic_graph
    - processed.append
    - <builtin>.any
    - y.intersection
    - nodeset.union
    - networkx.ancestors
    - <builtin>.set
    - collections.deque.popleft
    - networkx.algorithms.d_separation._reachable._pass
    - collections.deque
    - x.intersection
    - networkx.algorithms.d_separation._reachable
    - collections.deque.copy
    - itertools.chain
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 500
    functionName: networkx.algorithms.cluster.transitivity
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 190
    functionsReached:
    - G.adj.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - <builtin>.zip
    - <builtin>.sum
    - <builtin>.len
    - collections.Counter.items
    - G.nbunch_iter
    - <builtin>.set
    - <builtin>.map
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 74
    functionName: networkx.algorithms.euler.is_semieulerian
    functionSourceFile: networkx.algorithms.euler
    functionUses: 190
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.is_strongly_connected
    - <builtin>.sum
    - <builtin>.all
    - networkx.is_connected
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - networkx.is_eulerian
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.euler.has_eulerian_path
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.is_weakly_connected
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.euler.is_eulerian
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 1
    IfCount: 9
    argCount: 5
    argDefaultValues: []
    argNames:
    - G
    - x
    - y
    - included
    - restricted
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 339
    functionName: networkx.algorithms.d_separation.find_minimal_d_separator
    functionSourceFile: networkx.algorithms.d_separation
    functionUses: 190
    functionsReached:
    - collections.deque.append
    - networkx.is_directed_acyclic_graph
    - processed.append
    - <builtin>.any
    - nodeset.union
    - networkx.ancestors
    - collections.deque.popleft
    - <builtin>.set
    - networkx.algorithms.d_separation._reachable._pass
    - collections.deque
    - networkx.algorithms.d_separation._reachable
    - collections.deque.copy
    - itertools.chain
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 13
    functionName: networkx.algorithms.bipartite.extendability.maximal_extendability
    functionSourceFile: networkx.algorithms.bipartite.extendability
    functionUses: 190
    functionsReached:
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.bipartite.sets
    - networkx.is_perfect_matching
    - <builtin>.float
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx._clear_cache
    - networkx.is_connected
    - attr.copy
    - networkx.is_strongly_connected
    - <builtin>.sum
    - <builtin>.iter
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.classes.reportviews.NodeView.__iter__
    - maximum_matching.keys
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.node_disjoint_paths
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35e4f0>
    argNames:
    - G
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 351
    functionName: networkx.algorithms.link_prediction.preferential_attachment
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 190
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - S
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 698
    functionName: networkx.algorithms.centrality.group.group_in_degree_centrality
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 190
    functionsReached:
    - G.reverse
    - G.nodes
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.centrality.group.group_degree_centrality
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 201
    functionName: networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 192
    functionsReached:
    - G.copy
    - H.remove_edges_from
    - networkx.connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16a90>
    argNames:
    - G
    - top_nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 59
    functionName: networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 192
    functionsReached:
    - networkx.isolates
    - queue.append
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.basic.sets
    - seen.add
    - networkx.algorithms.bipartite.basic.color
    - nextlevel.append
    - color.update
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - <builtin>.next
    - itertools.chain
    - leftmatches.items
    - rightmatches.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    - collections.deque
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - queue.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 7
    IfCount: 7
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a9edbe0>
    argNames:
    - G
    - flow_func
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 22
    functionName: networkx.algorithms.connectivity.kcomponents.k_components
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 190
    functionsReached:
    - networkx.connected_components
    - components.append
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - set.union
    - <builtin>.map
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - G.subgraph
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - <builtin>.max
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - G.degree
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - stack.append
    - B.subgraph
    - networkx.biconnected_components
    - G.order
    - <builtin>.list
    - <builtin>.iter
    - collections.defaultdict
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - <builtin>.range
    - networkx.all_node_cuts
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.node_connectivity
    - <builtin>.dict
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 21
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 11
    EdgeCount: 30
    ICount: 1
    IfCount: 21
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 407
    functionName: networkx.algorithms.triads.triad_type
    functionSourceFile: networkx.algorithms.triads
    functionUses: 191
    functionsReached:
    - networkx.algorithms.triads.is_triad
    - G.nodes
    - itertools.permutations
    - G.order
    - <builtin>.len
    - <builtin>.set
    - <builtin>.isinstance
    - networkx.is_directed
    - G.edges
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 117
    functionName: networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    functionSourceFile: networkx.algorithms.approximation.dominating_set
    functionUses: 190
    functionsReached:
    - matching.add
    - networkx.algorithms.matching.maximal_matching
    - <builtin>.set
    - nodes.update
    - G.edges
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06100>
    - <ast.Constant object at 0x7f734bc06910>
    argNames:
    - G
    - avail
    - weight
    - partial
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 626
    functionName: networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 194
    functionsReached:
    - networkx.connected_components
    - <builtin>.zip
    - collections.defaultdict.items
    - G.__class__
    - C.add_edges_from
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.minimum_spanning_tree
    - <builtin>.enumerate
    - remaining.difference_update
    - networkx.set_node_attributes
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.is_connected
    - meta_mst.edges
    - <builtin>.len
    - <builtin>.set
    - remaining.issuperset
    - collections.namedtuple
    - C.add_nodes_from
    - mapping.update
    - <builtin>.list
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - <builtin>.isinstance
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - avail.values
    - G.edges
    - collections.defaultdict
    - avail.keys
    - <builtin>.range
    - G.nodes
    - <builtin>.min
    - G.has_edge
    - itertools.compress
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8a30>
    argNames:
    - G
    - matching_algorithm
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 15
    functionName: networkx.algorithms.covering.min_edge_cover
    functionSourceFile: networkx.algorithms.covering
    functionUses: 191
    functionsReached:
    - networkx.isolates
    - queue.append
    - maximum_matching.items
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.basic.sets
    - seen.add
    - networkx.algorithms.bipartite.basic.color
    - nextlevel.append
    - color.update
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - seen.update
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - <builtin>.next
    - itertools.chain
    - functools.partial
    - leftmatches.items
    - rightmatches.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - <builtin>.isinstance
    - queue.pop
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - min_cover.add
    - networkx.utils.arbitrary_element
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.number_of_isolates
    - <builtin>.dict
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - queue.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8460>
    argNames:
    - G
    - number_of_nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.centrality.voterank_alg.voterank
    functionSourceFile: networkx.algorithms.centrality.voterank_alg
    functionUses: 190
    functionsReached:
    - G.is_directed
    - <builtin>.range
    - <builtin>.max
    - G.nodes
    - G.out_degree
    - <builtin>.sum
    - <builtin>.len
    - G.degree
    - G.edges
    - influential_nodes.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 18
    functionName: networkx.algorithms.components.connected.connected_components
    functionSourceFile: networkx.algorithms.components.connected
    functionUses: 207
    functionsReached:
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - seen.update
    - networkx.algorithms.components.connected._plain_bfs
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 105
    functionName: networkx.algorithms.centrality.degree_alg.out_degree_centrality
    functionSourceFile: networkx.algorithms.centrality.degree_alg
    functionUses: 190
    functionsReached:
    - <builtin>.len
    - G.out_degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 14
    functionName: networkx.algorithms.threshold.is_threshold_graph
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 190
    functionsReached:
    - ds.sort
    - networkx.algorithms.threshold.is_threshold_sequence
    - <builtin>.len
    - ds.pop
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    - k
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 80
    functionName: networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.maximum_flow_value
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.has_path
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - communities
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.community.community_utils.is_partition
    functionSourceFile: networkx.algorithms.community.community_utils
    functionUses: 196
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - <builtin>.list
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 64
    functionName: networkx.algorithms.efficiency_measures.global_efficiency
    functionSourceFile: networkx.algorithms.efficiency_measures
    functionUses: 191
    functionsReached:
    - <builtin>.len
    - networkx.all_pairs_shortest_path_length
    - targets.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8d90>
    argNames:
    - G
    - source
    - target
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 262
    functionName: networkx.algorithms.simple_paths.all_simple_edge_paths
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 191
    functionsReached:
    - stack.append
    - current_path.values
    - current_path.popitem
    - stack.pop
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.list
    - <builtin>.set
    - G.is_multigraph
    - <builtin>.next
    - current_path.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 185
    functionName: networkx.algorithms.polynomials.chromatic_polynomial
    functionSourceFile: networkx.algorithms.polynomials
    functionUses: 190
    functionsReached:
    - networkx.contracted_edge
    - C.remove_edge
    - collections.deque.append
    - sympy.Symbol
    - G.remove_edge
    - <builtin>.list
    - <builtin>.len
    - collections.deque.pop
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 18
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 10
    EdgeCount: 26
    ICount: 13
    IfCount: 18
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc261f0>
    argNames:
    - G
    - length_bound
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 478
    functionName: networkx.algorithms.cycles.chordless_cycles
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 190
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - scc_queue.pop
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - scc.add
    - G.adj.items
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - queue.pop
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - G.has_edge
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - itertools.combinations
    - copy.deepcopy
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - itertools.chain.from_iterable
    - collections.abc.Mapping.attr.items
    - queue.append
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - components.extend
    - keydict.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - stack.pop
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - Gu.items
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - <builtin>.isinstance
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - G.graph.update
    - G.__class__
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.components.biconnected.biconnected_components
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - stack.append
    - scc_found.update
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.classes.graphviews.subgraph_view
    - itertools.product
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.algorithms.cycles.chordless_cycles.stems
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - collections.abc.Mapping.items
    - edge_stack.append
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.nodes_with_selfloops
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - d.popitem
    - scc_queue.append
    - d.items
    - d.copy
    - N.graph.update
    - visited.add
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf34c0>
    argNames:
    - G
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 51
    functionName: networkx.algorithms.link_prediction.resource_allocation_index
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 190
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8250>
    argNames:
    - G
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 158
    functionName: networkx.linalg.spectrum.bethe_hessian_spectrum
    functionSourceFile: networkx.linalg.spectrum
    functionUses: 190
    functionsReached:
    - networkx.bethe_hessian_matrix
    - scipy.linalg.eigvalsh
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 112
    functionName: networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 190
    functionsReached:
    - networkx.connected_components
    - networkx.minimum_cut
    - G.__class__
    - G.number_of_nodes
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.get
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - G1.number_of_nodes
    - G.subgraph
    - datadict.update
    - C.nodes
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - H.nodes
    - functools.partial
    - G.is_directed
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - G1.remove_edges_from
    - H.is_directed
    - H.remove_edges_from
    - networkx.minimum_edge_cut
    - avail.intersection
    - <builtin>.iter
    - R0.pop
    - aux_graph.k_edge_components
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - H.add_nodes_from
    - <builtin>.isinstance
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - G.nodes
    - R0.add
    - G.copy
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.strongly_connected_components
    - networkx.utils.decorators.not_implemented_for
    - H.number_of_nodes
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24520>
    - <ast.Constant object at 0x7f734cd248b0>
    argNames:
    - G
    - source
    - neighbors
    - depth_limit
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 20
    functionName: networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 197
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.classes.digraph.DiGraph.predecessors
    - <builtin>.sorted
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - next_parents_children.append
    - <builtin>.iter
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.successors
    - <builtin>.set
    - copy.deepcopy.neighbors
    - copy.deepcopy.predecessors
    - seen.add
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 29
    functionName: networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - G.number_of_nodes
    - networkx.is_connected
    - G.degree
    - networkx.has_bridges
    - <builtin>.any
    - networkx.edge_connectivity
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 1
    IfCount: 11
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9c880>
    - <ast.Constant object at 0x7f734cf9c130>
    - <ast.Constant object at 0x7f734cf9cd30>
    argNames:
    - G
    - s
    - t
    - flow_func
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 456
    functionName: networkx.algorithms.connectivity.cuts.minimum_edge_cut
    functionSourceFile: networkx.algorithms.connectivity.cuts
    functionUses: 190
    functionsReached:
    - networkx.minimum_cut
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - nbrs.items
    - cutset.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.dominating_set
    - networkx.is_connected
    - <builtin>.len
    - <builtin>.set
    - attr.get
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - <builtin>.hasattr
    - D.pop
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.is_weakly_connected
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 344
    functionName: networkx.algorithms.triads.triads_by_type
    functionSourceFile: networkx.algorithms.triads
    functionUses: 190
    functionsReached:
    - collections.defaultdict
    - G.subgraph
    - networkx.algorithms.triads.is_triad
    - G.nodes
    - itertools.permutations
    - G.order
    - <builtin>.len
    - itertools.combinations
    - <builtin>.set
    - <builtin>.isinstance
    - networkx.is_directed
    - networkx.algorithms.triads.all_triads
    - G.edges
    - <builtin>.any
    - networkx.algorithms.triads.triad_type
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1173
    functionName: networkx.algorithms.cycles.girth
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 190
    functionsReached:
    - networkx.bfs_labeled_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1279
    functionName: networkx.algorithms.dag.v_structures
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - G.has_edge
    - itertools.combinations
    - G.predecessors
    - networkx.algorithms.dag.colliders
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d8e44c0>
    - <ast.Constant object at 0x7f734ceb05b0>
    argNames:
    - G
    - strategy
    - interchange
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 266
    functionName: networkx.algorithms.coloring.greedy_coloring.greedy_color
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 190
    functionsReached:
    - col_used.discard
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.max
    - <builtin>.len
    - itertools.dropwhile
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - itertools.count
    - <builtin>.list
    - <builtin>.callable
    - frontier.append
    - G.edges
    - <builtin>.range
    - visited.add
    - visited.intersection
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - graph.values
    - STRATEGIES.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc61a60>
    argNames:
    - G
    - topo_order
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 941
    functionName: networkx.algorithms.dag.antichains
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - networkx.topological_sort
    - <builtin>.reversed
    - stack.pop
    - <builtin>.list
    - antichains_stacks.append
    - networkx.transitive_closure_dag
    - antichains_stacks.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0fe20>
    - <ast.Constant object at 0x7f734cd0f040>
    - <ast.Constant object at 0x7f734cd0f160>
    argNames:
    - G
    - avail
    - weight
    - partial
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 392
    functionName: networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 193
    functionsReached:
    - networkx.connected_components
    - <builtin>.zip
    - collections.defaultdict.items
    - G.__class__
    - C.add_edges_from
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.minimum_spanning_tree
    - <builtin>.enumerate
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - remaining.difference_update
    - networkx.set_node_attributes
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - C.nodes
    - networkx.is_connected
    - meta_mst.edges
    - <builtin>.len
    - <builtin>.set
    - remaining.issuperset
    - collections.namedtuple
    - C.add_nodes_from
    - mapping.update
    - <builtin>.list
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - <builtin>.isinstance
    - avail.values
    - G.edges
    - collections.defaultdict
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - <builtin>.range
    - avail.keys
    - G.nodes
    - <builtin>.min
    - G.has_edge
    - itertools.compress
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67fd30>
    - <ast.Constant object at 0x7f734a67f0d0>
    - <ast.Constant object at 0x7f734a67f160>
    - <ast.Constant object at 0x7f734a67f850>
    - <ast.Constant object at 0x7f734a67fdc0>
    - <ast.Constant object at 0x7f734a67f1f0>
    argNames:
    - G
    - u
    - v
    - normalized
    - alpha
    - b
    - c
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 9
    functionName: networkx.algorithms.centrality.dispersion.dispersion
    functionSourceFile: networkx.algorithms.centrality.dispersion
    functionUses: 190
    functionsReached:
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - <builtin>.len
    - itertools.combinations
    - <builtin>.set
    - dict.fromkeys
    - nbrs_s.isdisjoint
    - u_nbrs.intersection
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 583
    functionName: networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 194
    functionsReached:
    - collections.defaultdict
    - networkx.connected_components
    - remaining.issuperset
    - <builtin>.range
    - C.nodes
    - <builtin>.zip
    - G.__class__
    - C.add_nodes_from
    - G.nodes
    - mapping.update
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - C.add_edges_from
    - networkx.set_node_attributes
    - <builtin>.list
    - <builtin>.set
    - <builtin>.enumerate
    - remaining.difference_update
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 125
    functionName: networkx.algorithms.efficiency_measures.local_efficiency
    functionSourceFile: networkx.algorithms.efficiency_measures
    functionUses: 190
    functionsReached:
    - G.subgraph
    - <builtin>.sum
    - <builtin>.len
    - targets.items
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.all_pairs_shortest_path_length
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc902e0>
    argNames:
    - G
    - top_nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 159
    functionName: networkx.algorithms.bipartite.basic.sets
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 196
    functionsReached:
    - networkx.isolates
    - queue.append
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.basic.color
    - seen.add
    - nextlevel.append
    - color.update
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - seen.update
    - <builtin>.next
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.digraph.DiGraph.is_directed
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 10
    functionName: networkx.algorithms.planarity.is_planar
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 190
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - keydict.get
    - attr.copy
    - networkx.classes.digraph.DiGraph.remove_edge
    - newdict.update
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - <builtin>.sum
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.get_counterexample
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - succs.pop
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.digraph.DiGraph.degree
    - d.popitem
    - <builtin>.hasattr
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.planarity.LRPlanarity.sign
    - <builtin>.list
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.ConflictPair.__init__
    - collections.defaultdict
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - Q.right.copy
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.planarity.top_of_stack
    - <builtin>.min
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - dfs_stack.pop
    - networkx._clear_cache
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 10
    IfCount: 7
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d4b03d0>
    argNames:
    - G
    - avail
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 850
    functionName: networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - <builtin>.zip
    - nbrs.items
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - C.nodes
    - collections.abc.Mapping.keys
    - bridge_connectors.add
    - remaining.issuperset
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - collections.defaultdict
    - avail.keys
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.has_edge
    - G.copy
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.connected_components
    - collections.defaultdict.items
    - keydict.get
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - keydict.items
    - remaining.difference_update
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.dfs_tree
    - networkx.minimum_spanning_arborescence
    - mapping.update
    - <builtin>.iter
    - <builtin>.isinstance
    - avail.values
    - datadict.copy
    - networkx.tree_all_pairs_lowest_common_ancestor
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - itertools.compress
    - G.graph.update
    - G.__class__
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - C.degree
    - networkx.set_node_attributes
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.has_bridges
    - G.edges
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - G.nodes
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.predecessors
    - meta_to_wuv.keys
    - networkx.reverse
    - C.add_edges_from
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - <builtin>.enumerate
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - meta_mst.edges
    - <builtin>.next
    - d.popitem
    - collections.namedtuple
    - C.add_nodes_from
    - <builtin>.list
    - d.copy
    - networkx.freeze
    - networkx.set_edge_attributes
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - A.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 22
    functionName: networkx.algorithms.bipartite.basic.color
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 198
    functionsReached:
    - color.update
    - networkx.isolates
    - queue.append
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.iter
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.successors
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - dict.fromkeys
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35e070>
    - <ast.Constant object at 0x7f734c35e4f0>
    argNames:
    - G
    - source
    - keys
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 159
    functionName: networkx.algorithms.euler.eulerian_circuit
    functionSourceFile: networkx.algorithms.euler
    functionUses: 190
    functionsReached:
    - networkx.reverse_view
    - G.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - networkx.is_strongly_connected
    - networkx.classes.digraph.DiGraph.remove_edge
    - H.add_edges_from
    - <builtin>.all
    - vertex_stack.pop
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - collections.abc.Mapping.keys
    - networkx.is_connected
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - vertex_stack.append
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - H.graph.update
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - d.popitem
    - G.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - <builtin>.list
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - <builtin>.iter
    - H.add_nodes_from
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.euler.is_eulerian
    - d.copy
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.utils.arbitrary_element
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.freeze
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 137
    functionName: networkx.algorithms.tree.distance_measures.centroid
    functionSourceFile: networkx.algorithms.tree.distance_measures
    functionUses: 190
    functionsReached:
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - stack.append
    - networkx.utils.pairwise
    - networkx.utils.arbitrary_element
    - sizes.get
    - <builtin>.reversed
    - <builtin>.max
    - networkx.dfs_edges
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.is_tree
    - stack.pop
    - G.number_of_nodes
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cfc70>
    argNames:
    - G
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 260
    functionName: networkx.algorithms.cluster.all_triangles
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 190
    functionsReached:
    - node_to_id.get
    - G.nbunch_iter
    - <builtin>.enumerate
    - dict.fromkeys
    - G.neighbors
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 88
    functionName: networkx.algorithms.bipartite.basic.is_bipartite
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 190
    functionsReached:
    - color.update
    - networkx.isolates
    - queue.append
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.iter
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.successors
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - dict.fromkeys
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - queue.pop
    - networkx.algorithms.bipartite.basic.color
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 17
    functionName: networkx.algorithms.simple_paths.is_simple_path
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 190
    functionsReached:
    - itertools.pairwise
    - <builtin>.zip
    - <builtin>.len
    - itertools.tee
    - <builtin>.set
    - <builtin>.all
    - <builtin>.next
    - networkx.utils.misc.pairwise
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 8
    IfCount: 6
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7344698580>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 103
    functionName: networkx.algorithms.clique.find_cliques
    functionSourceFile: networkx.algorithms.clique
    functionUses: 194
    functionsReached:
    - stack.append
    - cand.remove
    - ext_u.pop
    - <builtin>.max
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - Q.pop
    - Q.append
    - cand.copy
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 119
    functionName: networkx.algorithms.distance_regular.intersection_array
    functionSourceFile: networkx.algorithms.distance_regular
    functionUses: 192
    functionsReached:
    - collections.defaultdict
    - itertools.combinations_with_replacement
    - <builtin>.range
    - cint.get
    - <builtin>.max
    - math.log
    - networkx.is_connected
    - <builtin>.sum
    - <builtin>.len
    - bint.get
    - networkx.single_source_shortest_path_length
    - pl_u.update
    - pl_n.update
    - pl_n.items
    - networkx.is_regular
    - pl_u.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbbaee0>
    argNames:
    - G
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 313
    functionName: networkx.algorithms.dag.lexicographical_topological_sort
    functionSourceFile: networkx.algorithms.dag
    functionUses: 190
    functionsReached:
    - G.is_directed
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - heapq.heappop
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - heapq.heappush
    - <builtin>.enumerate
    - heapq.heapify
    - G.in_degree
    - G.edges
    linkageType: pythonLinkage
    raised:
    - TypeError
    - RuntimeError
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 111
    functionName: networkx.algorithms.dominating.connected_dominating_set
    functionSourceFile: networkx.algorithms.dominating
    functionUses: 190
    functionsReached:
    - unseen_degree.items
    - <builtin>.max
    - heapq.heappop
    - connected_dominating_set.add
    - networkx.is_connected
    - itertools.count
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - heapq.heappush
    - <builtin>.next
    - unseen.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 15
    functionName: networkx.algorithms.components.weakly_connected.weakly_connected_components
    functionSourceFile: networkx.algorithms.components.weakly_connected
    functionUses: 204
    functionsReached:
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 260
    functionName: networkx.algorithms.community.quality.partition_quality
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 190
    functionsReached:
    - G.is_directed
    - <builtin>.sum
    - <builtin>.len
    - itertools.combinations
    - G.is_multigraph
    - <builtin>.enumerate
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55880>
    argNames:
    - G
    - source
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 240
    functionName: networkx.algorithms.euler.has_eulerian_path
    functionSourceFile: networkx.algorithms.euler
    functionUses: 193
    functionsReached:
    - G.is_directed
    - networkx.is_connected
    - <builtin>.sum
    - networkx.is_weakly_connected
    - networkx.is_eulerian
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a37f0>
    argNames:
    - G
    - nbunch1
    - nbunch2
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 111
    functionName: networkx.algorithms.boundary.node_boundary
    functionSourceFile: networkx.algorithms.boundary
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 7
    IfCount: 11
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64b2b0>
    - <ast.Constant object at 0x7f734d64b2e0>
    argNames:
    - G
    - source
    - orientation
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 881
    functionName: networkx.algorithms.cycles.find_cycle
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 190
    functionsReached:
    - G.is_directed
    - cycle.extend
    - networkx.edge_dfs
    - explored.update
    - networkx.algorithms.cycles.find_cycle.tailhead
    - edges.append
    - <builtin>.set
    - G.nbunch_iter
    - <builtin>.enumerate
    - active_nodes.add
    - active_nodes.remove
    - seen.add
    - edges.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 10
    functionName: networkx.algorithms.regular.is_regular
    functionSourceFile: networkx.algorithms.regular
    functionUses: 190
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.all
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.utils.arbitrary_element
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 357
    functionName: networkx.algorithms.threshold.find_alternating_4_cycle
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 190
    functionsReached:
    - G.has_edge
    - G.nodes
    - G.edges
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 238
    functionName: networkx.algorithms.community.label_propagation.label_propagation_communities
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 190
    functionsReached:
    - collections.defaultdict
    - coloring.items
    - networkx.algorithms.community.label_propagation._update_label
    - collections.Counter.values
    - <builtin>.max
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - <builtin>.len
    - networkx.algorithms.community.label_propagation._color_network
    - collections.defaultdict.values
    - collections.Counter.items
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - colors.items
    - <builtin>.all
    - labeling.items
    - high_labels.pop
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 18
    functionName: networkx.algorithms.approximation.clique.maximum_independent_set
    functionSourceFile: networkx.algorithms.approximation.clique
    functionUses: 190
    functionsReached:
    - graph.remove_nodes_from
    - c_1.add
    - networkx.non_neighbors
    - networkx.utils.arbitrary_element
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - G.subgraph
    - isets.append
    - <builtin>.max
    - i_2.add
    - <builtin>.iter
    - G.copy
    - <builtin>.set
    - networkx.all_neighbors
    - <builtin>.isinstance
    - cliques.append
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.approximation.clique.clique_removal
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35e070>
    - <ast.Constant object at 0x7f734c35ed00>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 296
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 190
    functionsReached:
    - networkx.dfs_labeled_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfe640>
    - <ast.Constant object at 0x7f734cbfe460>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 332
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_successors
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 190
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - <builtin>.sorted
    - seen.add
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.neighbors
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - children.append
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 695
    functionName: networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - networkx.connected_components
    - T.add_edges_from
    - <builtin>.sorted
    - <builtin>.zip
    - collections.defaultdict.items
    - G.__class__
    - C.add_edges_from
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - <builtin>.enumerate
    - remaining.difference_update
    - networkx.set_node_attributes
    - networkx.dfs_preorder_nodes
    - T.degree
    - C.copy
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - G2.add_edge
    - remaining.issuperset
    - C.add_nodes_from
    - <builtin>.tuple
    - mapping.update
    - <builtin>.list
    - G2.has_edge
    - math.ceil
    - itertools.product
    - G.edges
    - collections.defaultdict
    - <builtin>.range
    - G.nodes
    - G.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7344e635e0>
    argNames:
    - G
    - coloring
    - num_colors
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 20
    functionName: networkx.algorithms.coloring.equitable_coloring.is_equitable
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 190
    functionsReached:
    - collections.defaultdict
    - <builtin>.range
    - <builtin>.all
    - <builtin>.list
    - <builtin>.len
    - collections.defaultdict.values
    - <builtin>.set
    - coloring.values
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23940>
    argNames:
    - G
    - cutoff
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 141
    functionName: networkx.algorithms.centrality.load.edge_load_centrality
    functionSourceFile: networkx.algorithms.centrality.load
    functionUses: 190
    functionsReached:
    - <builtin>.sorted
    - length.items
    - ubetween.items
    - onodes.pop
    - <builtin>.len
    - operator.itemgetter
    - networkx.algorithms.centrality.load._edge_betweenness
    - networkx.predecessor
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 246
    functionName: networkx.algorithms.chordal.chordal_graph_treewidth
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 190
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.graph.Graph.number_of_edges
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.number_of_selfloops
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.chordal.is_chordal
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - unnumbered.remove
    - networkx.algorithms.chordal._max_cardinality_node
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.chordal._find_missing_edge
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.chordal._is_complete_graph
    - <builtin>.iter
    - <builtin>.isinstance
    - missing.pop
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - datadict.items
    - networkx.empty_graph
    - numbered.add
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - networkx.chordal_graph_cliques
    - N.graph.update
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90e80>
    - <ast.Constant object at 0x7f734bc902e0>
    - <ast.Constant object at 0x7f734bc901c0>
    argNames:
    - G
    - niter
    - nrand
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 250
    functionName: networkx.algorithms.smallworld.sigma
    functionSourceFile: networkx.algorithms.smallworld
    functionUses: 190
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.maximum_flow_value
    - networkx.number_of_edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx._clear_cache
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - numpy.mean
    - <builtin>.hasattr
    - networkx.algorithms.smallworld.random_reference
    - G.add_edge
    - networkx.average_shortest_path_length
    - G.remove_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - bisect.bisect_left
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.neighbors
    - <builtin>.range
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - seed.choice
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - G.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.transitivity
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 55
    functionName: networkx.algorithms.centrality.degree_alg.in_degree_centrality
    functionSourceFile: networkx.algorithms.centrality.degree_alg
    functionUses: 190
    functionsReached:
    - <builtin>.len
    - G.in_degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 1
    IfCount: 10
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24a00>
    - <ast.Constant object at 0x7f734cd246d0>
    - <ast.Constant object at 0x7f734cd24e50>
    argNames:
    - G
    - s
    - t
    - flow_func
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 310
    functionName: networkx.algorithms.connectivity.cuts.minimum_node_cut
    functionSourceFile: networkx.algorithms.connectivity.cuts
    functionUses: 190
    functionsReached:
    - itertools.chain.from_iterable
    - networkx.minimum_cut
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.sum
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.enumerate
    - cutset.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - edges.append
    - networkx.is_connected
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - <builtin>.len
    - G.predecessors
    - <builtin>.set
    - attr.get
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.is_weakly_connected
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.get
    - G.edges
    - G.successors
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - G.has_edge
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf4c0>
    - <ast.Constant object at 0x7f734a4cf100>
    argNames:
    - G
    - r
    - nodelist
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 12
    functionName: networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    functionSourceFile: networkx.linalg.bethehessianmatrix
    functionUses: 190
    functionsReached:
    - networkx.degree
    - scipy.sparse.dia_array
    - <builtin>.list
    - A.sum
    - <builtin>.sum
    - networkx.to_scipy_sparse_array
    - scipy.sparse.eye_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 19
    IfCount: 13
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfbaf0>
    - <ast.Constant object at 0x7f734ccfb400>
    argNames:
    - G
    - k
    - flow_func
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 26
    functionName: networkx.algorithms.connectivity.kcutsets.all_node_cuts
    functionSourceFile: networkx.algorithms.connectivity.kcutsets
    functionUses: 190
    functionsReached:
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - <builtin>.sorted
    - S.update
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.sum
    - attr.copy
    - newdict.update
    - path.reverse
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.enumerate
    - networkx.transitive_closure
    - cutset.update
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx._clear_cache
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.restricted_view
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - edges.append
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - <builtin>.set
    - attr.get
    - <builtin>.next
    - q.append
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.condensation
    - networkx.antichains
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.density
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - seen.append
    - <builtin>.float
    - copy.copy
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - G.edges
    - collections.defaultdict
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.node_connectivity
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - S_ancestors.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - G.degree
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - cmap.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1361
    functionName: networkx.classes.function.number_of_selfloops
    functionSourceFile: networkx.classes.function
    functionUses: 190
    functionsReached:
    - networkx.selfloop_edges
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 88
    functionName: networkx.algorithms.components.attracting.is_attracting_component
    functionSourceFile: networkx.algorithms.components.attracting
    functionUses: 190
    functionsReached:
    - <builtin>.hasattr
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.condensation
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.len
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 44
    functionName: networkx.algorithms.isolate.isolates
    functionSourceFile: networkx.algorithms.isolate
    functionUses: 191
    functionsReached:
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 241
    functionName: networkx.algorithms.dominating.is_connected_dominating_set
    functionSourceFile: networkx.algorithms.dominating
    functionUses: 190
    functionsReached:
    - networkx.subgraph
    - networkx.is_dominating_set
    - networkx.is_connected
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 75
    functionName: networkx.algorithms.approximation.clique.max_clique
    functionSourceFile: networkx.algorithms.approximation.clique
    functionUses: 190
    functionsReached:
    - networkx.all_neighbors
    - networkx.non_neighbors
    - G.subgraph
    - <builtin>.max
    - <builtin>.set
    - cliques.append
    - <builtin>.next
    - c_1.add
    - graph.remove_nodes_from
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.complement
    - networkx.utils.arbitrary_element
    - isets.append
    - i_2.add
    - G.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 8
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 173
    functionName: networkx.algorithms.chordal.chordal_graph_cliques
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 191
    functionsReached:
    - networkx.classes.graph.Graph.number_of_edges
    - numbered.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - new_clique_wanna_be.add
    - <builtin>.sum
    - unnumbered.remove
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.algorithms.components.connected._plain_bfs
    - C.number_of_nodes
    - seen.add
    - nextlevel.append
    - networkx.classes.graph.Graph.size
    - G.subgraph
    - <builtin>.int
    - C.nodes
    - C.subgraph
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - seen.update
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - <builtin>.next
    - <builtin>.frozenset
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.chordal._is_complete_graph
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.number_of_selfloops
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.graph.Graph.number_of_nodes
    - C.neighbors
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 187
    functionName: networkx.algorithms.approximation.clique.large_clique_size
    functionSourceFile: networkx.algorithms.approximation.clique
    functionUses: 190
    functionsReached:
    - <builtin>.max
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - U.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 127
    functionName: networkx.linalg.spectrum.modularity_spectrum
    functionSourceFile: networkx.linalg.spectrum
    functionUses: 190
    functionsReached:
    - G.is_directed
    - networkx.modularity_matrix
    - networkx.directed_modularity_matrix
    - scipy.linalg.eigvals
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 5
    IfCount: 10
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0f9d0>
    argNames:
    - A
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 37
    functionName: networkx.drawing.nx_agraph.from_agraph
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 293
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - keydict.get
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1030
    functionName: networkx.classes.multigraph.MultiGraph.is_directed
    functionSourceFile: ''
    functionUses: 380
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 876
    functionName: networkx.classes.multidigraph.MultiDiGraph.is_directed
    functionSourceFile: ''
    functionUses: 425
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.is_strict
    functionSourceFile: <builtin>
    functionUses: 294
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.empty_graph
    functionSourceFile: ''
    functionUses: 398
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.graph.update
    functionSourceFile: <builtin>
    functionUses: 294
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 757
    functionName: networkx.classes.graph.Graph.nodes
    functionSourceFile: networkx.classes.graph
    functionUses: 334
    functionsReached:
    - networkx.classes.reportviews.NodeView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 187
    functionName: networkx.classes.reportviews.NodeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 432
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.str
    functionSourceFile: <builtin>
    functionUses: 407
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.attr.items
    functionSourceFile: collections
    functionUses: 294
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - node_for_adding
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 450
    functionName: networkx.classes.digraph.DiGraph.add_node
    functionSourceFile: networkx.classes.digraph
    functionUses: 362
    functionsReached:
    - attr_dict.update
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - node_for_adding
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 535
    functionName: networkx.classes.graph.Graph.add_node
    functionSourceFile: networkx.classes.graph
    functionUses: 339
    functionsReached:
    - attr_dict.update
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 602
    functionName: networkx.classes.multidigraph.MultiDiGraph.edges
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 393
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1342
    functionName: networkx.classes.reportviews.OutMultiEdgeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 345
    functionsReached:
    - nbrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.dict
    functionSourceFile: <builtin>
    functionUses: 494
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr.items
    functionSourceFile: <builtin>
    functionUses: 294
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 872
    functionName: networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    functionSourceFile: ''
    functionUses: 421
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8130>
    argNames:
    - self
    - u_for_edge
    - v_for_edge
    - key
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 428
    functionName: networkx.classes.multidigraph.MultiDiGraph.add_edge
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 543
    functionsReached:
    - datadict.update
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 865
    functionName: networkx.algorithms.planarity.PlanarEmbedding._forbidden
    functionSourceFile: ''
    functionUses: 551
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 10
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - N
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 119
    functionName: networkx.drawing.nx_agraph.to_agraph
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 4
    functionsReached:
    - N.is_directed
    - pygraphviz.AGraph
    - <builtin>.str
    - edgedata.items
    - N.graph.get
    - N.graph.items
    - N.edges
    - A.graph_attr.update
    - A.get_edge
    - nodedata.items
    - A.add_edge
    - N.nodes
    - N.is_multigraph
    - A.edge_attr.update
    - networkx.number_of_selfloops
    - A.node_attr.update
    - a.attr.update
    - A.add_node
    - A.get_node
    linkageType: pythonLinkage
    raised:
    - ImportError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.is_directed
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_of_selfloops
    functionSourceFile: ''
    functionUses: 217
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pygraphviz.AGraph
    functionSourceFile: pygraphviz
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.graph.get
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.graph_attr.update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.node_attr.update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.edge_attr.update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.graph.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.nodes
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.add_node
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.get_node
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodedata.items
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: N.edges
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgedata.items
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.add_edge
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.get_edge
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: a.attr.update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - path
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 188
    functionName: networkx.drawing.nx_agraph.write_dot
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 0
    functionsReached:
    - N.is_directed
    - pygraphviz.AGraph
    - A.clear
    - <builtin>.str
    - edgedata.items
    - N.graph.items
    - N.edges
    - A.graph_attr.update
    - nodedata.items
    - A.get_edge
    - A.add_edge
    - N.nodes
    - N.is_multigraph
    - A.edge_attr.update
    - networkx.number_of_selfloops
    - A.node_attr.update
    - a.attr.update
    - A.write
    - A.add_node
    - A.get_node
    - networkx.drawing.nx_agraph.to_agraph
    - N.graph.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.write
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.clear
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 211
    functionName: networkx.drawing.nx_agraph.read_dot
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - pygraphviz.AGraph
    - nbrs.items
    - keydict.get
    - A.clear
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ImportError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448340>
    - <ast.Constant object at 0x7f734c4485e0>
    - <ast.Constant object at 0x7f734c448970>
    argNames:
    - G
    - prog
    - root
    - args
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 231
    functionName: networkx.drawing.nx_agraph.graphviz_layout
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 0
    functionsReached:
    - N.is_directed
    - pygraphviz.AGraph
    - <builtin>.str
    - edgedata.items
    - N.graph.items
    - N.edges
    - A.graph_attr.update
    - nodedata.items
    - A.get_edge
    - A.add_edge
    - pygraphviz.Node
    - N.nodes
    - N.is_multigraph
    - <builtin>.tuple
    - A.edge_attr.update
    - <builtin>.print
    - networkx.number_of_selfloops
    - A.node_attr.update
    - <builtin>.float
    - a.attr.update
    - A.layout
    - networkx.drawing.nx_agraph.pygraphviz_layout
    - A.add_node
    - A.get_node
    - networkx.drawing.nx_agraph.to_agraph
    - N.graph.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c4483d0>
    - <ast.Constant object at 0x7f734c448d60>
    - <ast.Constant object at 0x7f734c448550>
    argNames:
    - G
    - prog
    - root
    - args
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 265
    functionName: networkx.drawing.nx_agraph.pygraphviz_layout
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 1
    functionsReached:
    - N.is_directed
    - pygraphviz.AGraph
    - <builtin>.str
    - edgedata.items
    - N.graph.items
    - N.edges
    - A.graph_attr.update
    - nodedata.items
    - A.get_edge
    - A.add_edge
    - pygraphviz.Node
    - N.nodes
    - N.is_multigraph
    - <builtin>.tuple
    - A.edge_attr.update
    - <builtin>.print
    - networkx.number_of_selfloops
    - A.node_attr.update
    - <builtin>.float
    - a.attr.update
    - A.layout
    - A.add_node
    - A.get_node
    - networkx.drawing.nx_agraph.to_agraph
    - N.graph.get
    linkageType: pythonLinkage
    raised:
    - ImportError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.layout
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pygraphviz.Node
    functionSourceFile: pygraphviz
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.float
    functionSourceFile: <builtin>
    functionUses: 340
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.tuple
    functionSourceFile: <builtin>
    functionUses: 263
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.print
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.open_file
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.utils.decorators.argmap
    functionSourceFile: networkx.utils.decorators
    functionUses: 143
    functionsReached:
    - collections.namedtuple
    - re.compile
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 10
    IfCount: 8
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64beb0>
    - <ast.Constant object at 0x7f734d64b460>
    - <ast.Constant object at 0x7f734d64bd30>
    - <ast.Constant object at 0x7f734d64b6d0>
    - <ast.Constant object at 0x7f734d64b3d0>
    - <ast.Constant object at 0x7f734d64b580>
    argNames:
    - G
    - edgelabel
    - prog
    - args
    - suffix
    - path
    - show
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 326
    functionName: networkx.drawing.nx_agraph.view_pygraphviz
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 0
    functionsReached:
    - N.is_directed
    - networkx.drawing.nx_agraph.view_pygraphviz.update_attrs
    - pygraphviz.AGraph
    - <builtin>.str
    - edgedata.items
    - PIL.Image.open
    - tempfile.NamedTemporaryFile
    - N.graph.items
    - <builtin>.len
    - N.edges
    - A.graph_attr.update
    - nodedata.items
    - A.get_edge
    - attrs.items
    - A.add_edge
    - added.append
    - path.close
    - N.nodes
    - N.is_multigraph
    - A.edge_attr.update
    - <builtin>.callable
    - G.is_multigraph
    - networkx.drawing.nx_agraph.view_pygraphviz.clean_attrs
    - A.draw
    - networkx.number_of_selfloops
    - A.node_attr.update
    - a.attr.update
    - G.edges
    - A.add_node
    - A.get_node
    - networkx.drawing.nx_agraph.to_agraph
    - N.graph.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.len
    functionSourceFile: <builtin>
    functionUses: 1241
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - which
    - attrs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 400
    functionName: networkx.drawing.nx_agraph.view_pygraphviz.update_attrs
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 1
    functionsReached:
    - added.append
    - attrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attrs.items
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: added.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - which
    - added
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 408
    functionName: networkx.drawing.nx_agraph.view_pygraphviz.clean_attrs
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.callable
    functionSourceFile: <builtin>
    functionUses: 253
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - data
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 432
    functionName: networkx.drawing.nx_agraph.view_pygraphviz.func
    functionSourceFile: networkx.drawing.nx_agraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 324
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.edges
    functionSourceFile: <builtin>
    functionUses: 362
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tempfile.NamedTemporaryFile
    functionSourceFile: tempfile
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.draw
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.close
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: PIL.Image.open
    functionSourceFile: PIL
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.drawing.layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.utils.decorators.np_random_state
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - center
    - dim
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 42
    functionName: networkx.drawing.layout._process_params
    functionSourceFile: networkx.drawing.layout
    functionUses: 11
    functionsReached:
    - numpy.asarray
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - attr.copy
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - <builtin>.isinstance
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.isinstance
    functionSourceFile: <builtin>
    functionUses: 543
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - nodes_for_adding
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 500
    functionName: networkx.classes.digraph.DiGraph.add_nodes_from
    functionSourceFile: networkx.classes.digraph
    functionUses: 419
    functionsReached:
    - attr.copy
    - <builtin>.iter
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.zeros
    functionSourceFile: numpy
    functionUses: 248
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.asarray
    functionSourceFile: numpy
    functionUses: 40
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - random_state_argument
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 264
    functionName: networkx.utils.decorators.np_random_state
    functionSourceFile: networkx.utils.decorators
    functionUses: 6
    functionsReached:
    - networkx.utils.decorators.argmap.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cce80d0>
    - <ast.Constant object at 0x7f734cce8e80>
    - <ast.Constant object at 0x7f734cce87f0>
    - <ast.Constant object at 0x7f734cce8a60>
    argNames:
    - G
    - center
    - dim
    - seed
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 64
    functionName: networkx.drawing.layout.random_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - seed.rand
    - networkx.drawing.layout._process_params
    - numpy.asarray
    - numpy.zeros
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - attr.copy
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.dict
    - pos.astype
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.set_node_attributes
    - networkx._clear_cache
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.rand
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos.astype
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.zip
    functionSourceFile: <builtin>
    functionUses: 440
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.set_node_attributes
    functionSourceFile: ''
    functionUses: 233
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e130>
    - <ast.Constant object at 0x7f734b66e430>
    - <ast.Constant object at 0x7f734b66ea90>
    - <ast.Constant object at 0x7f734b66ec40>
    argNames:
    - G
    - scale
    - center
    - dim
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 129
    functionName: networkx.drawing.layout.circular_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - pos.mean
    - numpy.cos
    - theta.astype
    - numpy.abs
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - <builtin>.len
    - networkx.drawing.layout._process_params
    - numpy.column_stack
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.iter
    - <builtin>.isinstance
    - numpy.linspace
    - networkx.utils.arbitrary_element
    - numpy.sin
    - <builtin>.dict
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.max
    functionSourceFile: <builtin>
    functionUses: 387
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.arbitrary_element
    functionSourceFile: ''
    functionUses: 258
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linspace
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: theta.astype
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.cos
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.sin
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.column_stack
    functionSourceFile: numpy
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73450079d0>
    argNames:
    - pos
    - scale
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1882
    functionName: networkx.drawing.layout.rescale_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 10
    functionsReached:
    - pos.mean
    - numpy.abs
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 3
    IfCount: 7
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3ee0>
    - <ast.Constant object at 0x7f734d3a3760>
    - <ast.Constant object at 0x7f734d3a33d0>
    - <ast.Constant object at 0x7f734d3a3b20>
    - <ast.Constant object at 0x7f734d3a3be0>
    - <ast.Constant object at 0x7f734d3a36a0>
    argNames:
    - G
    - nlist
    - rotate
    - scale
    - center
    - dim
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 214
    functionName: networkx.drawing.layout.shell_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - numpy.cos
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - npos.update
    - networkx.drawing.layout._process_params
    - numpy.column_stack
    - numpy.asarray
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - numpy.linspace
    - networkx.utils.arbitrary_element
    - numpy.sin
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.list
    functionSourceFile: <builtin>
    functionUses: 621
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: npos.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccffaf0>
    - <ast.Constant object at 0x7f734ccff130>
    - <ast.Constant object at 0x7f734ccff6d0>
    - <ast.Constant object at 0x7f734ccfff70>
    - <ast.BinOp object at 0x7f734ccff190>
    - <ast.Constant object at 0x7f734ccffb50>
    argNames:
    - G
    - nodes
    - align
    - scale
    - center
    - aspect_ratio
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 322
    functionName: networkx.drawing.layout.bipartite_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - numpy.repeat
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - pos.mean
    - networkx.algorithms.bipartite.sets
    - numpy.abs
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.drawing.layout._process_params
    - numpy.column_stack
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - numpy.linspace
    - numpy.concatenate
    - <builtin>.dict
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.sets
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.set
    functionSourceFile: <builtin>
    functionUses: 856
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.repeat
    functionSourceFile: numpy
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.concatenate
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 16
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 23
    ICount: 3
    IfCount: 16
    argCount: 14
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06190>
    - <ast.Constant object at 0x7f734bc066d0>
    - <ast.Constant object at 0x7f734bc068b0>
    - <ast.Constant object at 0x7f734bc06a30>
    - <ast.Constant object at 0x7f734bc06940>
    - <ast.Constant object at 0x7f734bc06790>
    - <ast.Constant object at 0x7f734bc06400>
    - <ast.Constant object at 0x7f734bc060a0>
    - <ast.Constant object at 0x7f734bc06a90>
    - <ast.Constant object at 0x7f734bc06460>
    - <ast.Constant object at 0x7f734bc06d60>
    argNames:
    - G
    - k
    - pos
    - fixed
    - iterations
    - threshold
    - weight
    - scale
    - center
    - dim
    - seed
    - store_pos_as
    - method
    - gravity
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 452
    functionName: networkx.drawing.layout.spring_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - numpy.bincount
    - <builtin>.zip
    - numpy.sqrt
    - attr.copy
    - newdict.update
    - networkx.drawing.layout._energy_fruchterman_reingold
    - networkx.to_scipy_sparse_array
    - <builtin>.enumerate
    - networkx.set_node_attributes
    - pos.mean
    - numpy.clip
    - scipy.optimize.minimize
    - numpy.abs
    - A.tolil
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - scipy.sparse.csgraph.connected_components
    - <builtin>.len
    - scipy.sparse.coo_array
    - networkx.drawing.layout._process_params
    - pos.values
    - networkx.to_numpy_array
    - pos.ravel
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - numpy.einsum
    - <builtin>.iter
    - A.getrowview
    - <builtin>.isinstance
    - A.tocsr
    - scipy.sparse.csr_array
    - numpy.linalg.norm
    - seed.rand
    - networkx.utils.arbitrary_element
    - <builtin>.range
    - G.nodes
    - networkx.drawing.layout._sparse_fruchterman_reingold
    - <builtin>.min
    - <builtin>.dict
    - pos.astype
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.drawing.layout._fruchterman_reingold
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.enumerate
    functionSourceFile: <builtin>
    functionUses: 409
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos.values
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.nodes
    functionSourceFile: <builtin>
    functionUses: 283
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.to_scipy_sparse_array
    functionSourceFile: ''
    functionUses: 207
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.sqrt
    functionSourceFile: numpy
    functionUses: 34
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 0
    IfCount: 6
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67f8e0>
    - <ast.Constant object at 0x7f734a67fc10>
    - <ast.Constant object at 0x7f734a67f940>
    - <ast.Constant object at 0x7f734a67fd30>
    - <ast.Constant object at 0x7f734a67f1c0>
    - <ast.Constant object at 0x7f734a67f6a0>
    - <ast.Constant object at 0x7f734a67f970>
    - <ast.Constant object at 0x7f734a67f520>
    - <ast.Constant object at 0x7f734a67f730>
    argNames:
    - A
    - k
    - pos
    - fixed
    - iterations
    - threshold
    - dim
    - seed
    - method
    - gravity
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 724
    functionName: networkx.drawing.layout._sparse_fruchterman_reingold
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - numpy.bincount
    - numpy.sqrt
    - networkx.drawing.layout._energy_fruchterman_reingold
    - numpy.clip
    - scipy.optimize.minimize
    - A.tolil
    - numpy.abs
    - <builtin>.max
    - scipy.sparse.csgraph.connected_components
    - scipy.sparse.coo_array
    - pos.ravel
    - numpy.asarray
    - A.getrowview
    - A.tocsr
    - scipy.sparse.csr_array
    - numpy.linalg.norm
    - seed.rand
    - <builtin>.range
    - <builtin>.min
    - pos.astype
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.to_numpy_array
    functionSourceFile: ''
    functionUses: 213
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb65e0>
    - <ast.Constant object at 0x7f734cbb6040>
    - <ast.Constant object at 0x7f734cbb6130>
    - <ast.Constant object at 0x7f734cbb6ee0>
    - <ast.Constant object at 0x7f734cbb6160>
    - <ast.Constant object at 0x7f734cbb6df0>
    - <ast.Constant object at 0x7f734cbb6eb0>
    argNames:
    - A
    - k
    - pos
    - fixed
    - iterations
    - threshold
    - dim
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 660
    functionName: networkx.drawing.layout._fruchterman_reingold
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - numpy.clip
    - seed.rand
    - <builtin>.range
    - numpy.asarray
    - numpy.zeros
    - <builtin>.max
    - numpy.sqrt
    - <builtin>.min
    - numpy.einsum
    - pos.astype
    - numpy.linalg.norm
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.min
    functionSourceFile: <builtin>
    functionUses: 442
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.range
    functionSourceFile: <builtin>
    functionUses: 542
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.norm
    functionSourceFile: numpy
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.clip
    functionSourceFile: numpy
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.einsum
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 9
    argDefaultValues: []
    argNames:
    - A
    - nnodes
    - k
    - pos
    - fixed
    - iterations
    - threshold
    - dim
    - gravity
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 814
    functionName: networkx.drawing.layout._energy_fruchterman_reingold
    functionSourceFile: networkx.drawing.layout
    functionUses: 2
    functionsReached:
    - numpy.bincount
    - scipy.optimize.minimize
    - pos.ravel
    - numpy.abs
    - scipy.sparse.csgraph.connected_components
    - A.tocsr
    - scipy.sparse.csr_array
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.tolil
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.coo_array
    functionSourceFile: scipy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.getrowview
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.tocsr
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.csr_array
    functionSourceFile: scipy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.abs
    functionSourceFile: numpy
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.csgraph.connected_components
    functionSourceFile: scipy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.bincount
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 839
    functionName: networkx.drawing.layout._energy_fruchterman_reingold._cost_FR
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - numpy.maximum
    - x.reshape
    - numpy.log
    - <builtin>.min
    - numpy.sqrt
    - numpy.einsum
    - numpy.add.at
    - numpy.sum
    - numpy.linalg.norm
    - grad.ravel
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.reshape
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.sum
    functionSourceFile: numpy
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.maximum
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.log
    functionSourceFile: numpy
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.add.at
    functionSourceFile: numpy
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: grad.ravel
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos.ravel
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.optimize.minimize
    functionSourceFile: scipy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 2
    IfCount: 8
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e460>
    - <ast.Constant object at 0x7f734a65e0a0>
    - <ast.Constant object at 0x7f734a65e130>
    - <ast.Constant object at 0x7f734a65ec10>
    - <ast.Constant object at 0x7f734a65e2e0>
    - <ast.Constant object at 0x7f734a65efd0>
    - <ast.Constant object at 0x7f734a65e430>
    argNames:
    - G
    - dist
    - pos
    - weight
    - scale
    - center
    - dim
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 876
    functionName: networkx.drawing.layout.kamada_kawai_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - numpy.ones
    - networkx.drawing.layout._kamada_kawai_solve
    - <builtin>.zip
    - attr.copy
    - newdict.update
    - <builtin>.enumerate
    - networkx.set_node_attributes
    - pos.mean
    - numpy.cos
    - networkx.drawing.layout.random_layout
    - theta.astype
    - scipy.optimize.minimize
    - numpy.abs
    - pos_arr.ravel
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - numpy.array
    - <builtin>.len
    - networkx.drawing.layout._process_params
    - numpy.eye
    - numpy.column_stack
    - networkx.shortest_path_length
    - numpy.asarray
    - networkx.drawing.layout.circular_layout
    - networkx.drawing.layout.rescale_layout
    - <builtin>.iter
    - <builtin>.isinstance
    - numpy.linspace
    - seed.rand
    - networkx.utils.arbitrary_element
    - optresult.x.reshape
    - numpy.sin
    - <builtin>.dict
    - pos.astype
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.shortest_path_length
    functionSourceFile: ''
    functionUses: 226
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.ones
    functionSourceFile: numpy
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.array
    functionSourceFile: numpy
    functionUses: 240
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - dist_mtx
    - pos_arr
    - dim
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 978
    functionName: networkx.drawing.layout._kamada_kawai_solve
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - numpy.eye
    - pos_arr.ravel
    - scipy.optimize.minimize
    - optresult.x.reshape
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.eye
    functionSourceFile: numpy
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos_arr.ravel
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: optresult.x.reshape
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - pos_vec
    - np
    - invdist
    - meanweight
    - dim
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1000
    functionName: networkx.drawing.layout._kamada_kawai_costfn
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - np.eye
    - np.einsum
    - np.linalg.norm
    - np.sum
    - pos_vec.reshape
    - grad.ravel
    - np.diag_indices
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos_vec.reshape
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.linalg.norm
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.eye
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.einsum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.diag_indices
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 2
    IfCount: 7
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f73477cb3d0>
    - <ast.Constant object at 0x7f73477cb400>
    - <ast.Constant object at 0x7f73477cb430>
    - <ast.Constant object at 0x7f73477cb460>
    - <ast.Constant object at 0x7f73477cb490>
    argNames:
    - G
    - weight
    - scale
    - center
    - dim
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1025
    functionName: networkx.drawing.layout.spectral_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - numpy.linalg.eig
    - numpy.real
    - <builtin>.zip
    - attr.copy
    - numpy.sqrt
    - A.sum
    - numpy.argsort
    - newdict.update
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - pos.mean
    - networkx.drawing.layout._sparse_spectral
    - numpy.abs
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - numpy.array
    - <builtin>.len
    - networkx.drawing.layout._process_params
    - networkx.to_numpy_array
    - G.is_directed
    - networkx.drawing.layout._spectral
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.iter
    - <builtin>.isinstance
    - numpy.identity
    - scipy.sparse.dia_array
    - numpy.transpose
    - scipy.sparse.linalg.eigsh
    - <builtin>.dict
    - numpy.sum
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.is_directed
    functionSourceFile: <builtin>
    functionUses: 395
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.transpose
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73477eb430>
    argNames:
    - A
    - dim
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1143
    functionName: networkx.drawing.layout._sparse_spectral
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - scipy.sparse.dia_array
    - <builtin>.int
    - numpy.real
    - <builtin>.max
    - numpy.sqrt
    - A.sum
    - numpy.argsort
    - scipy.sparse.linalg.eigsh
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73477f2520>
    argNames:
    - A
    - dim
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1122
    functionName: networkx.drawing.layout._spectral
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - numpy.linalg.eig
    - numpy.real
    - numpy.argsort
    - numpy.sum
    - numpy.identity
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.identity
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.eig
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.argsort
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.real
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.sum
    functionSourceFile: <builtin>
    functionUses: 210
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.dia_array
    functionSourceFile: scipy
    functionUses: 209
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.int
    functionSourceFile: <builtin>
    functionUses: 266
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.eigsh
    functionSourceFile: scipy
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f73477e19d0>
    - <ast.Constant object at 0x7f73477e1a00>
    - <ast.Constant object at 0x7f73477e1a30>
    - <ast.Constant object at 0x7f73477e1a60>
    argNames:
    - G
    - scale
    - center
    - dim
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1169
    functionName: networkx.drawing.layout.planar_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - pos.mean
    - numpy.abs
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - numpy.vstack
    - <builtin>.len
    - networkx.drawing.layout._process_params
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.combinatorial_embedding_to_pos
    - <builtin>.dict
    - pos.astype
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.check_planarity
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.check_planarity
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.combinatorial_embedding_to_pos
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.vstack
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7346726c70>
    - <ast.Constant object at 0x7f7346726c40>
    - <ast.Constant object at 0x7f7346726c10>
    - <ast.Constant object at 0x7f7346726be0>
    - <ast.Constant object at 0x7f7346726bb0>
    - <ast.Constant object at 0x7f7346726b80>
    argNames:
    - G
    - scale
    - center
    - dim
    - resolution
    - equidistant
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1242
    functionName: networkx.drawing.layout.spiral_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - pos.mean
    - numpy.cos
    - pos.append
    - numpy.abs
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - numpy.array
    - <builtin>.len
    - networkx.drawing.layout._process_params
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.iter
    - <builtin>.isinstance
    - numpy.arange
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - numpy.sin
    - numpy.transpose
    - <builtin>.dict
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.arange
    functionSourceFile: numpy
    functionUses: 204
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 3
    IfCount: 7
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7346722580>
    - <ast.Constant object at 0x7f7346722550>
    - <ast.Constant object at 0x7f7346722520>
    - <ast.Constant object at 0x7f73467224f0>
    - <ast.Constant object at 0x7f73467224c0>
    argNames:
    - G
    - subset_key
    - align
    - scale
    - center
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1353
    functionName: networkx.drawing.layout.multipartite_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - layers.values
    - <builtin>.zip
    - numpy.repeat
    - attr.copy
    - <builtin>.sum
    - newdict.update
    - <builtin>.enumerate
    - networkx.set_node_attributes
    - pos.mean
    - subset_key.values
    - networkx.get_node_attributes
    - numpy.abs
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.groups
    - <builtin>.len
    - nodes.extend
    - networkx.drawing.layout._process_params
    - numpy.column_stack
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.iter
    - subset_key.items
    - <builtin>.isinstance
    - numpy.arange
    - numpy.concatenate
    - <builtin>.dict
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: subset_key.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.sum
    functionSourceFile: <builtin>
    functionUses: 475
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.get_node_attributes
    functionSourceFile: ''
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.groups
    functionSourceFile: ''
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: subset_key.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.sorted
    functionSourceFile: <builtin>
    functionUses: 370
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: layers.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes.extend
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 3
    IfCount: 7
    argCount: 9
    argDefaultValues:
    - <ast.Constant object at 0x7f7346717400>
    - <ast.Constant object at 0x7f73467173d0>
    - <ast.Constant object at 0x7f73467173a0>
    - <ast.Constant object at 0x7f7346717370>
    - <ast.Constant object at 0x7f7346717340>
    - <ast.Constant object at 0x7f7346717310>
    argNames:
    - G
    - pos
    - scaling
    - a
    - etol
    - dt
    - max_iter
    - seed
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1466
    functionName: networkx.drawing.layout.arf_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - numpy.ones
    - numpy.nansum
    - warnings.catch_warnings
    - numpy.asarray
    - pos.values
    - <builtin>.zip
    - warnings.simplefilter
    - G.nodes
    - numpy.sqrt
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.enumerate
    - networkx.set_node_attributes
    - numpy.eye
    - networkx.random_layout
    - G.edges
    - numpy.linalg.norm
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.random_layout
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: warnings.catch_warnings
    functionSourceFile: warnings
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: warnings.simplefilter
    functionSourceFile: warnings
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.nansum
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 5
    IfCount: 13
    argCount: 15
    argDefaultValues:
    - <ast.Constant object at 0x7f7346731910>
    argNames:
    - G
    - pos
    - max_iter
    - jitter_tolerance
    - scaling_ratio
    - gravity
    - distributed_action
    - strong_gravity
    - node_mass
    - node_size
    - weight
    - linlog
    - seed
    - dim
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1604
    functionName: networkx.drawing.layout.forceatlas2_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - numpy.ones
    - numpy.log
    - <builtin>.zip
    - numpy.sqrt
    - numpy.fill_diagonal
    - <builtin>.enumerate
    - networkx.set_node_attributes
    - <builtin>.abs
    - networkx.random_layout
    - networkx.drawing.layout.forceatlas2_layout.estimate_factor
    - <builtin>.max
    - numpy.array
    - <builtin>.len
    - pos_init.max
    - pos.values
    - networkx.to_numpy_array
    - numpy.mean
    - node_size.get
    - node_mass.get
    - <builtin>.list
    - numpy.einsum
    - numpy.minimum
    - numpy.linalg.norm
    - seed.rand
    - <builtin>.range
    - numpy.nan_to_num
    - numpy.errstate
    - <builtin>.min
    - <builtin>.dict
    - G.degree
    - pos_init.min
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos_init.max
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos_init.min
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.degree
    functionSourceFile: <builtin>
    functionUses: 276
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_mass.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_size.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 6
    argDefaultValues: []
    argNames:
    - n
    - swing
    - traction
    - speed
    - speed_efficiency
    - jitter_tolerance
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1734
    functionName: networkx.drawing.layout.forceatlas2_layout.estimate_factor
    functionSourceFile: networkx.drawing.layout
    functionUses: 1
    functionsReached:
    - <builtin>.max
    - numpy.sqrt
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.fill_diagonal
    functionSourceFile: numpy
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.mean
    functionSourceFile: numpy
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.errstate
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.nan_to_num
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.minimum
    functionSourceFile: numpy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.abs
    functionSourceFile: <builtin>
    functionUses: 232
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos.mean
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7345004190>
    argNames:
    - pos
    - scale
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1927
    functionName: networkx.drawing.layout.rescale_layout_dict
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - numpy.abs
    - <builtin>.zip
    - numpy.array
    - networkx.drawing.layout.rescale_layout
    - <builtin>.list
    - <builtin>.dict
    - pos.values
    - pos.mean
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - start
    - align
    - scale
    - center
    - store_pos_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1965
    functionName: networkx.drawing.layout.bfs_layout
    functionSourceFile: networkx.drawing.layout
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - layers.values
    - <builtin>.zip
    - numpy.repeat
    - attr.copy
    - <builtin>.sum
    - newdict.update
    - <builtin>.enumerate
    - networkx.set_node_attributes
    - pos.mean
    - subset_key.values
    - networkx.get_node_attributes
    - numpy.abs
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.groups
    - <builtin>.len
    - nodes.extend
    - networkx.drawing.layout._process_params
    - numpy.column_stack
    - numpy.asarray
    - networkx.drawing.layout.rescale_layout
    - <builtin>.iter
    - networkx.bfs_layers
    - subset_key.items
    - <builtin>.isinstance
    - numpy.arange
    - numpy.concatenate
    - networkx.drawing.layout.multipartite_layout
    - <builtin>.dict
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bfs_layers
    functionSourceFile: ''
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils
    functionSourceFile: networkx.utils
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.utils.random_sequence
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 0
    functionsReached:
    - networkx.utils.py_random_state
    - networkx.utils.decorators.py_random_state
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - networkx.utils.decorators.argmap
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.py_random_state
    functionSourceFile: ''
    functionUses: 34
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - random_state_argument
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 311
    functionName: networkx.utils.decorators.py_random_state
    functionSourceFile: networkx.utils.decorators
    functionUses: 36
    functionsReached:
    - networkx.utils.decorators.argmap.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23310>
    - <ast.Constant object at 0x7f734cc23d60>
    argNames:
    - n
    - exponent
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 26
    functionName: networkx.utils.random_sequence.powerlaw_sequence
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.paretovariate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.paretovariate
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - degree_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 33
    functionName: networkx.utils.random_sequence.is_valid_tree_degree_sequence
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - <builtin>.any
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.any
    functionSourceFile: <builtin>
    functionUses: 301
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcb520>
    - <ast.Constant object at 0x7f734cfcba30>
    argNames:
    - alpha
    - xmin
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 66
    functionName: networkx.utils.random_sequence.zipf_rv
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.int
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.random
    functionSourceFile: <builtin>
    functionUses: 255
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - distribution
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 130
    functionName: networkx.utils.random_sequence.cumulative_distribution
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 199
    functionsReached:
    - cdf.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cdf.append
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06700>
    - <ast.Constant object at 0x7f734bc06280>
    - <ast.Constant object at 0x7f734bc06220>
    argNames:
    - n
    - distribution
    - cdistribution
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 142
    functionName: networkx.utils.random_sequence.discrete_sequence
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 198
    functionsReached:
    - <builtin>.range
    - seed.random
    - bisect.bisect_left
    - cdf.append
    - networkx.utils.random_sequence.cumulative_distribution
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bisect.bisect_left
    functionSourceFile: bisect
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc90040>
    argNames:
    - mapping
    - k
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 174
    functionName: networkx.utils.random_sequence.random_weighted_sample
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 3
    functionsReached:
    - seed.random
    - collections.Counter.values
    - networkx.utils.random_sequence.weighted_choice
    - <builtin>.list
    - sample.add
    - <builtin>.len
    - <builtin>.sum
    - <builtin>.set
    - collections.Counter.items
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63d700>
    argNames:
    - mapping
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 188
    functionName: networkx.utils.random_sequence.weighted_choice
    functionSourceFile: networkx.utils.random_sequence
    functionUses: 6
    functionsReached:
    - collections.Counter.values
    - seed.random
    - <builtin>.sum
    - collections.Counter.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sample.add
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter.values
    functionSourceFile: collections
    functionUses: 206
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter.items
    functionSourceFile: collections
    functionUses: 210
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.utils.backends
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - _sig.replace
    - importlib.metadata.entry_points.name.isidentifier
    - networkx.utils.backends._get_backends
    - os.environ.get
    - logging.getLogger
    - importlib.metadata.entry_points
    - importlib.metadata.entry_points.load
    - _sig.parameters.items
    - inspect.signature
    - rv.pop
    - warnings.warn
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: logging.getLogger
    functionSourceFile: logging
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - group
    - load_and_call
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 45
    functionName: networkx.utils.backends._get_backends
    functionSourceFile: networkx.utils.backends
    functionUses: 2
    functionsReached:
    - importlib.metadata.entry_points.name.isidentifier
    - importlib.metadata.entry_points
    - importlib.metadata.entry_points.load
    - rv.pop
    - warnings.warn
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.metadata.entry_points
    functionSourceFile: importlib
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.metadata.entry_points.name.isidentifier
    functionSourceFile: importlib
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: warnings.warn
    functionSourceFile: warnings
    functionUses: 38
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.metadata.entry_points.load
    functionSourceFile: importlib
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rv.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - string
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 114
    functionName: networkx.utils.backends._comma_sep_to_list
    functionSourceFile: networkx.utils.backends
    functionUses: 1
    functionsReached:
    - x.strip
    - string.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: string.strip
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.strip
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 118
    functionName: networkx.utils.backends._set_configs_from_environment
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - backends.keys
    - <builtin>.sorted
    - networkx.utils.backends._get_backends
    - importlib.metadata.entry_points
    - os.environ.get
    - rv.pop
    - warnings.warn
    - <builtin>.bool
    - backend_info.keys
    - networkx.utils.backends._comma_sep_to_list
    - <builtin>.type
    - <builtin>.set
    - string.strip
    - priorities.pop
    - os.environ.items
    - backend_info.items
    - x.strip
    - <builtin>.isinstance
    - backend_info.update
    - importlib.metadata.entry_points.name.isidentifier
    - key.startswith
    - importlib.metadata.entry_points.load
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend_info.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backends.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend_info.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend_info.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.type
    functionSourceFile: <builtin>
    functionUses: 31
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: os.environ.get
    functionSourceFile: os
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.bool
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: os.environ.items
    functionSourceFile: os
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: key.startswith
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: priorities.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 188
    functionName: networkx.utils.backends._do_nothing
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - name
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 198
    functionName: networkx.utils.backends._always_run
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 0
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - backend_name
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 202
    functionName: networkx.utils.backends._load_backend
    functionSourceFile: networkx.utils.backends
    functionUses: 7
    functionsReached:
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised:
    - ImportError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.hasattr
    functionSourceFile: <builtin>
    functionUses: 472
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 18
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 10
    EdgeCount: 26
    ICount: 3
    IfCount: 18
    argCount: 13
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448e80>
    argNames:
    - cls
    - func
    - name
    - graphs
    - edge_attrs
    - node_attrs
    - preserve_edge_attrs
    - preserve_node_attrs
    - preserve_graph_attrs
    - preserve_all_attrs
    - mutates_input
    - returns_graph
    - implemented_by_nx
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 218
    functionName: networkx.utils.backends._dispatchable.__new__
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - functools.partial
    - object.__new__
    - <builtin>.len
    - backend_info.items
    - <builtin>.set
    - networkx.utils.decorators.argmap.__init__
    - graphs.items
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - TypeError
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: object.__new__
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphs.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - func
    - args
    - try_finally
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 710
    functionName: networkx.utils.decorators.argmap.__init__
    functionSourceFile: ''
    functionUses: 233
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - val
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 496
    functionName: networkx.utils.backends._dispatchable.__doc__
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 504
    functionName: networkx.utils.backends._dispatchable.__signature__
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - sig.parameters.values
    - <builtin>.any
    - sig.replace
    - inspect.signature
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: inspect.signature
    functionSourceFile: inspect
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sig.parameters.values
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sig.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - args
    - backend
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 541
    functionName: networkx.utils.backends._dispatchable._call_if_no_backends_installed
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    - ImportError
    returnType: N/A
  - BBCount: 43
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 20
    EdgeCount: 61
    ICount: 23
    IfCount: 43
    argCount: 3
    argDefaultValues: []
    argNames:
    - args
    - backend
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 554
    functionName: networkx.utils.backends._dispatchable._call_if_any_backends_installed
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - graphs_resolved.keys
    - group2.append
    - cache.pop
    - <builtin>.enumerate
    - <builtin>.all
    - seen.add
    - graph_backend_names.discard
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - itertools.chain
    - graph_backend_names.update
    - <builtin>.list
    - <builtin>.iter
    - group1.append
    - graphs_resolved.items
    - <builtin>.isinstance
    - group5.append
    - group4.append
    - <builtin>.getattr
    - graphs_resolved.values
    - nx.config.backend_priority.get
    - backends_to_try_again.append
    - _logger.debug
    linkageType: pythonLinkage
    raised:
    - RuntimeError
    - NotImplementedError
    - TypeError
    - ImportError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphs_resolved.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.getattr
    functionSourceFile: <builtin>
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphs_resolved.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_backend_names.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphs_resolved.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nx.config.backend_priority.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_backend_names.discard
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: _logger.debug
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.iter
    functionSourceFile: <builtin>
    functionUses: 673
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.next
    functionSourceFile: <builtin>
    functionUses: 553
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.all
    functionSourceFile: <builtin>
    functionUses: 281
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen.add
    functionSourceFile: <builtin>
    functionUses: 378
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: group1.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: group2.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: group4.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: group5.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.chain
    functionSourceFile: itertools
    functionUses: 270
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backends_to_try_again.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1052
    functionName: networkx.utils.backends._dispatchable._will_call_mutate_input
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - arg_name.startswith
    - kwargs.get
    - mutates_input.items
    - <builtin>.len
    - <builtin>.isinstance
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arg_name.startswith
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kwargs.get
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutates_input.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - graph_backend_names
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1077
    functionName: networkx.utils.backends._dispatchable._can_convert
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - _logger.debug
    - graph_backend_names.issubset
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_backend_names.issubset
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1091
    functionName: networkx.utils.backends._dispatchable._does_backend_have
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - networkx.utils.backends._load_backend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1099
    functionName: networkx.utils.backends._dispatchable._can_backend_run
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - backend.can_run
    - networkx.utils.backends._load_backend
    - networkx.utils.backends._LazyArgsRepr.__init__
    - <builtin>.isinstance
    - _logger.debug
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend.can_run
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - func
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 2138
    functionName: networkx.utils.backends._LazyArgsRepr.__init__
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1124
    functionName: networkx.utils.backends._dispatchable._should_backend_run
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - networkx.utils.backends._load_backend
    - networkx.utils.backends._LazyArgsRepr.__init__
    - <builtin>.isinstance
    - _logger.debug
    - backend.should_run
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend.should_run
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 30
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 15
    EdgeCount: 43
    ICount: 2
    IfCount: 30
    argCount: 6
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - args
    - kwargs
    - use_cache
    - mutations
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1148
    functionName: networkx.utils.backends._dispatchable._convert_arguments
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - edge_attrs.items
    - <builtin>.hasattr
    - bound.arguments.get
    - preserve_node_attrs.get
    - preserve_edge_attrs.get
    - bound.apply_defaults
    - <builtin>.getattr
    - node_attrs.items
    - <builtin>.callable
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bound.apply_defaults
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bound.arguments.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_attrs.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_attrs.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: preserve_edge_attrs.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: preserve_node_attrs.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 7
    IfCount: 9
    argCount: 11
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - graph
    - edge_attrs
    - node_attrs
    - preserve_edge_attrs
    - preserve_node_attrs
    - preserve_graph_attrs
    - graph_name
    - use_cache
    - mutations
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1359
    functionName: networkx.utils.backends._dispatchable._convert_graph
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - edge_attrs.items
    - networkx.utils.backends._get_from_cache
    - cache.items
    - cache.pop
    - warnings.warn
    - cache.setdefault
    - networkx.utils.backends._get_cache_key
    - cache.get
    - networkx.utils.backends._set_to_cache
    - <builtin>.frozenset
    - nkey.issubset
    - <builtin>.hasattr
    - edge_key.issubset
    - <builtin>.list
    - node_key.issubset
    - itertools.product
    - nx_cache.setdefault
    - mutations.append
    - <builtin>.getattr
    - networkx.utils.backends._load_backend
    - backend.convert_to_nx
    - node_attrs.items
    - ekey.issubset
    - _logger.debug
    - backend.convert_from_nx
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nx_cache.setdefault
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - edge_attrs
    - node_attrs
    - preserve_edge_attrs
    - preserve_node_attrs
    - preserve_graph_attrs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1977
    functionName: networkx.utils.backends._get_cache_key
    functionSourceFile: networkx.utils.backends
    functionUses: 1
    functionsReached:
    - edge_attrs.items
    - <builtin>.frozenset
    - node_attrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 14
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 21
    ICount: 3
    IfCount: 14
    argCount: 4
    argDefaultValues: []
    argNames:
    - cache
    - key
    - backend_name
    - mutations
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2000
    functionName: networkx.utils.backends._get_from_cache
    functionSourceFile: networkx.utils.backends
    functionUses: 1
    functionsReached:
    - nkey.issubset
    - edge_key.issubset
    - mutations.append
    - cache.items
    - <builtin>.list
    - ekey.issubset
    - cache.get
    - node_key.issubset
    - itertools.product
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend.convert_to_nx
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 4
    argDefaultValues: []
    argNames:
    - cache
    - key
    - graph
    - backend_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2084
    functionName: networkx.utils.backends._set_to_cache
    functionSourceFile: networkx.utils.backends
    functionUses: 1
    functionsReached:
    - nkey.issubset
    - <builtin>.list
    - cache.pop
    - ekey.issubset
    - cache.setdefault
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backend.convert_from_nx
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - args
    - kwargs
    - extra_message
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1484
    functionName: networkx.utils.backends._dispatchable._call_with_backend
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - networkx.utils.backends._load_backend
    - <builtin>.getattr
    - networkx.utils.backends._LazyArgsRepr.__init__
    - _logger.debug
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 7
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - input_backend_names
    - args
    - kwargs
    - extra_message
    - mutations
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1508
    functionName: networkx.utils.backends._dispatchable._convert_and_call
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - networkx.utils.backends._load_backend
    - <builtin>.getattr
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.next
    - networkx.utils.backends._LazyArgsRepr.__init__
    - _logger.debug
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 18
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 10
    EdgeCount: 26
    ICount: 15
    IfCount: 18
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - backend_name
    - args
    - kwargs
    - fallback_to_nx
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1588
    functionName: networkx.utils.backends._dispatchable._convert_and_call_for_tests
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - kwargs.items
    - networkx.utils.backends._dispatchable._convert_and_call_for_tests.assert_graphs_equal
    - G1.is_multigraph
    - <builtin>.zip
    - networkx.utils.backends._LazyArgsRepr.__init__
    - bound_backend.apply_defaults
    - G1.number_of_nodes
    - networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_iterator
    - <builtin>.any
    - G2.is_multigraph
    - <builtin>.type
    - bound_nx.apply_defaults
    - <builtin>.set
    - graph_nx.copy
    - <builtin>.hasattr
    - pytest.xfail
    - G2.number_of_nodes
    - G1.is_directed
    - kwargs_nx.pop
    - copy.copy
    - <builtin>.isinstance
    - val.values
    - G1.number_of_edges
    - networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_result
    - G2.number_of_edges
    - networkx.utils.backends._load_backend
    - <builtin>.getattr
    - backend.convert_to_nx
    - <builtin>.dict
    - itertools.tee
    - G2.is_directed
    - copy.deepcopy
    - _logger.debug
    linkageType: pythonLinkage
    raised:
    - RuntimeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pytest.xfail
    functionSourceFile: pytest
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy
    functionSourceFile: copy
    functionUses: 228
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.copy
    functionSourceFile: copy
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.tee
    functionSourceFile: itertools
    functionUses: 233
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kwargs.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bound_backend.apply_defaults
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bound_nx.apply_defaults
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_nx.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kwargs_nx.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734873d640>
    argNames:
    - val
    - depth
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1785
    functionName: networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_result
    functionSourceFile: networkx.utils.backends
    functionUses: 2
    functionsReached:
    - <builtin>.isinstance
    - val.values
    - networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_result
    linkageType: pythonLinkage
    raised:
    - RuntimeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: val.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - it
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1805
    functionName: networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_iterator
    functionSourceFile: networkx.utils.backends
    functionUses: 1
    functionsReached:
    - networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_result
    - val.values
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - RuntimeError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734872fca0>
    argNames:
    - G1
    - G2
    - strict
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1833
    functionName: networkx.utils.backends._dispatchable._convert_and_call_for_tests.assert_graphs_equal
    functionSourceFile: networkx.utils.backends
    functionUses: 1
    functionsReached:
    - G2.is_multigraph
    - G1.is_multigraph
    - G2.number_of_nodes
    - G2.number_of_edges
    - G1.is_directed
    - G2.is_directed
    - <builtin>.set
    - G1.number_of_edges
    - G1.number_of_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.number_of_nodes
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.number_of_nodes
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.is_directed
    functionSourceFile: <builtin>
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.is_directed
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 14
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 21
    ICount: 15
    IfCount: 14
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1870
    functionName: networkx.utils.backends._dispatchable._make_doc
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - lines.extend
    - func_info.get
    - new_doc.rstrip
    - <builtin>.len
    - new_doc.split
    - func_docs.split
    - lines.append
    - lines.pop
    - lines.insert
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lines.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: func_info.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: func_docs.split
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lines.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_doc.rstrip
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lines.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_doc.split
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lines.insert
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1965
    functionName: networkx.utils.backends._dispatchable.__reduce__
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - name
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1973
    functionName: networkx.utils.backends._restore_dispatchable
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.frozenset
    functionSourceFile: <builtin>
    functionUses: 231
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.product
    functionSourceFile: itertools
    functionUses: 235
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutations.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ekey.issubset
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nkey.issubset
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_key.issubset
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_key.issubset
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache.setdefault
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2144
    functionName: networkx.utils.backends._LazyArgsRepr.__repr__
    functionSourceFile: networkx.utils.backends
    functionUses: 0
    functionsReached:
    - bound.arguments.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bound.arguments.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73485db4c0>
    argNames:
    - func
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2160
    functionName: networkx.utils.backends._dispatchable
    functionSourceFile: networkx.utils.backends
    functionUses: 89
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: _sig.parameters.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: _sig.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.utils.configs
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.register
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a478f40>
    argNames:
    - cls
    - strict
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 70
    functionName: networkx.utils.configs.Config.__init_subclass__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 73
    functionName: networkx.utils.configs.Config.__new__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.type
    - instance.__init__
    - dataclasses.dataclass
    - object.__new__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dataclasses.dataclass
    functionSourceFile: dataclasses
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: instance.__init__
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 98
    functionName: networkx.utils.configs.Config._on_setattr
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 102
    functionName: networkx.utils.configs.Config._on_delattr
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 106
    functionName: networkx.utils.configs.Config.__dir__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 109
    functionName: networkx.utils.configs.Config.__setattr__
    functionSourceFile: networkx.utils.configs
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - networkx.utils.configs.Config.values
    - networkx.utils.configs.Config.items
    - <builtin>.setattr
    - <builtin>.all
    - <builtin>.dict
    - object.__setattr__
    - networkx.utils.configs.NetworkXConfig._on_setattr
    - collections.abc.ItemsView
    - <builtin>.map
    - networkx.utils.configs.BackendPriorities._on_setattr
    - collections.abc.ValuesView
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - AttributeError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 0
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 252
    functionName: networkx.utils.configs.BackendPriorities._on_setattr
    functionSourceFile: networkx.utils.configs
    functionUses: 3
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.sorted
    - <builtin>.all
    - <builtin>.map
    linkageType: pythonLinkage
    raised:
    - ValueError
    - TypeError
    - AttributeError
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 1
    IfCount: 12
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 348
    functionName: networkx.utils.configs.NetworkXConfig._on_setattr
    functionSourceFile: networkx.utils.configs
    functionUses: 3
    functionsReached:
    - <builtin>.sorted
    - networkx.utils.configs.Config.values
    - networkx.utils.configs.Config.items
    - <builtin>.setattr
    - <builtin>.dict
    - collections.abc.ItemsView
    - <builtin>.map
    - <builtin>.all
    - collections.abc.ValuesView
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - ValueError
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: object.__setattr__
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 116
    functionName: networkx.utils.configs.Config.__delattr__
    functionSourceFile: networkx.utils.configs
    functionUses: 1
    functionsReached:
    - networkx.utils.configs.BackendPriorities._on_delattr
    - object.__delattr__
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 272
    functionName: networkx.utils.configs.BackendPriorities._on_delattr
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: object.__delattr__
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 126
    functionName: networkx.utils.configs.Config.__contains__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 131
    functionName: networkx.utils.configs.Config.__iter__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 134
    functionName: networkx.utils.configs.Config.__len__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 137
    functionName: networkx.utils.configs.Config.__reversed__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.reversed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.reversed
    functionSourceFile: <builtin>
    functionUses: 283
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 141
    functionName: networkx.utils.configs.Config.__getitem__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.getattr
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 147
    functionName: networkx.utils.configs.Config.__setitem__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.utils.configs.Config.values
    - networkx.utils.configs.Config.items
    - <builtin>.setattr
    - <builtin>.all
    - <builtin>.map
    - <builtin>.dict
    - object.__setattr__
    - networkx.utils.configs.NetworkXConfig._on_setattr
    - collections.abc.ItemsView
    - networkx.utils.configs.Config.__setattr__
    - networkx.utils.configs.BackendPriorities._on_setattr
    - collections.abc.ValuesView
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 153
    functionName: networkx.utils.configs.Config.__delitem__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - networkx.utils.configs.BackendPriorities._on_delattr
    - object.__delattr__
    - networkx.utils.configs.Config.__delattr__
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67fc10>
    argNames:
    - self
    - key
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 162
    functionName: networkx.utils.configs.Config.get
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.getattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 165
    functionName: networkx.utils.configs.Config.items
    functionSourceFile: networkx.utils.configs
    functionUses: 5
    functionsReached:
    - collections.abc.ItemsView
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.ItemsView
    functionSourceFile: collections
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 168
    functionName: networkx.utils.configs.Config.keys
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - collections.abc.KeysView
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.KeysView
    functionSourceFile: collections
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 171
    functionName: networkx.utils.configs.Config.values
    functionSourceFile: networkx.utils.configs
    functionUses: 4
    functionsReached:
    - collections.abc.ValuesView
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.ValuesView
    functionSourceFile: collections
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - other
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 175
    functionName: networkx.utils.configs.Config.__eq__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - other.items
    - collections.abc.ItemsView
    - networkx.utils.configs.Config.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: other.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 181
    functionName: networkx.utils.configs.Config.__reduce__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 185
    functionName: networkx.utils.configs.Config._deserialize
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 189
    functionName: networkx.utils.configs.Config.__call__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - kwargs.items
    - <builtin>.sorted
    - networkx.utils.configs.Config.values
    - networkx.utils.configs.Config.items
    - <builtin>.setattr
    - <builtin>.all
    - <builtin>.dict
    - collections.abc.ItemsView
    - networkx.utils.configs.NetworkXConfig._on_setattr
    - <builtin>.map
    - networkx.utils.configs.BackendPriorities._on_setattr
    - collections.abc.ValuesView
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.setattr
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 197
    functionName: networkx.utils.configs.Config.__enter__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - RuntimeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - exc_type
    - exc_value
    - traceback
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 210
    functionName: networkx.utils.configs.Config.__exit__
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached:
    - <builtin>.setattr
    - prev.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: prev.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 216
    functionName: networkx.utils.configs._flexible_repr
    functionSourceFile: networkx.utils.configs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.register
    functionSourceFile: collections
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.map
    functionSourceFile: <builtin>
    functionUses: 259
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.misc
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a28b400>
    argNames:
    - obj
    - result
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 46
    functionName: networkx.utils.misc.flatten
    functionSourceFile: networkx.utils.misc
    functionUses: 4
    functionsReached:
    - <builtin>.isinstance
    - result.append
    - networkx.utils.misc.flatten
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: result.append
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 60
    functionName: networkx.utils.misc.make_list_of_ints
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - result.append
    - <builtin>.enumerate
    - <builtin>.int
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba44220>
    argNames:
    - d
    - mapping
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 96
    functionName: networkx.utils.misc.dict_to_numpy_array
    functionSourceFile: networkx.utils.misc
    functionUses: 5
    functionsReached:
    - <builtin>.range
    - s.update
    - networkx.utils.misc._dict_to_numpy_array1
    - <builtin>.zip
    - d.items
    - <builtin>.len
    - <builtin>.dict
    - mapping.items
    - <builtin>.set
    - v.keys
    - d.keys
    - networkx.utils.misc._dict_to_numpy_array2
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba44b20>
    argNames:
    - d
    - mapping
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 107
    functionName: networkx.utils.misc._dict_to_numpy_array2
    functionSourceFile: networkx.utils.misc
    functionUses: 6
    functionsReached:
    - <builtin>.range
    - s.update
    - <builtin>.zip
    - d.items
    - <builtin>.len
    - <builtin>.dict
    - mapping.items
    - <builtin>.set
    - v.keys
    - d.keys
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65ee20>
    argNames:
    - d
    - mapping
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 130
    functionName: networkx.utils.misc._dict_to_numpy_array1
    functionSourceFile: networkx.utils.misc
    functionUses: 6
    functionsReached:
    - <builtin>.range
    - numpy.zeros
    - <builtin>.zip
    - <builtin>.len
    - mapping.items
    - <builtin>.dict
    - <builtin>.set
    - d.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.keys
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.items
    functionSourceFile: <builtin>
    functionUses: 314
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v.keys
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: s.update
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.items
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - iterable
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 145
    functionName: networkx.utils.misc.arbitrary_element
    functionSourceFile: networkx.utils.misc
    functionUses: 243
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.next
    - <builtin>.iter
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b7835e0>
    argNames:
    - iterable
    - cyclic
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 214
    functionName: networkx.utils.misc.pairwise
    functionSourceFile: networkx.utils.misc
    functionUses: 231
    functionsReached:
    - itertools.pairwise
    - <builtin>.zip
    - itertools.tee
    - <builtin>.next
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.pairwise
    functionSourceFile: itertools
    functionUses: 232
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - many_to_one
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 249
    functionName: networkx.utils.misc.groups
    functionSourceFile: networkx.utils.misc
    functionUses: 196
    functionsReached:
    - collections.defaultdict
    - <builtin>.dict
    - many_to_one.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.defaultdict
    functionSourceFile: collections
    functionUses: 310
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: many_to_one.items
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448b20>
    argNames:
    - random_state
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 271
    functionName: networkx.utils.misc.create_random_state
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - numpy.random.RandomState
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.RandomState
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9cb80>
    argNames:
    - self
    - rng
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 319
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits.__init__
    functionSourceFile: networkx.utils.misc
    functionUses: 3
    functionsReached:
    - warnings.warn
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 335
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits.random
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - networkx.utils.misc.PythonRandomViaNumpyBits._rng.random
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits._rng.random
    functionSourceFile: networkx
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 339
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits.getrandbits
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - int.from_bytes
    - numpy.random.mtrand._rand.bytes
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.bytes
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: int.from_bytes
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 347
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits.getstate
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - numpy.random.mtrand._rand.__getstate__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.__getstate__
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 350
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits.setstate
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - numpy.random.mtrand._rand.__setstate__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.__setstate__
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - args
    - kwds
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 353
    functionName: networkx.utils.misc.PythonRandomViaNumpyBits.seed
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8520>
    argNames:
    - self
    - rng
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 364
    functionName: networkx.utils.misc.PythonRandomInterface.__init__
    functionSourceFile: networkx.utils.misc
    functionUses: 1
    functionsReached:
    - warnings.warn
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 376
    functionName: networkx.utils.misc.PythonRandomInterface.random
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - networkx.utils.misc.PythonRandomInterface._rng.random
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.misc.PythonRandomInterface._rng.random
    functionSourceFile: networkx
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - a
    - b
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 379
    functionName: networkx.utils.misc.PythonRandomInterface.uniform
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - networkx.utils.misc.PythonRandomInterface._rng.random
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64b580>
    argNames:
    - self
    - a
    - b
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 382
    functionName: networkx.utils.misc.PythonRandomInterface.randrange
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - random.Random.randrange
    - networkx.utils.misc.PythonRandomViaNumpyBits.__init__
    - <builtin>.isinstance
    - numpy.random.mtrand._rand.integers
    - warnings.warn
    - numpy.random.mtrand._rand.randint
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: random.Random.randrange
    functionSourceFile: random
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.integers
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.randint
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - seq
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 397
    functionName: networkx.utils.misc.PythonRandomInterface.choice
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - numpy.random.mtrand._rand.integers
    - numpy.random.mtrand._rand.randint
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - mu
    - sigma
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 406
    functionName: networkx.utils.misc.PythonRandomInterface.gauss
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - numpy.random.mtrand._rand.normal
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.normal
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - seq
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 409
    functionName: networkx.utils.misc.PythonRandomInterface.shuffle
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - numpy.random.mtrand._rand.shuffle
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.shuffle
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - seq
    - k
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 415
    functionName: networkx.utils.misc.PythonRandomInterface.sample
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - <builtin>.list
    - numpy.random.mtrand._rand.choice
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.choice
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - a
    - b
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 418
    functionName: networkx.utils.misc.PythonRandomInterface.randint
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - networkx.utils.misc.PythonRandomViaNumpyBits.__init__
    - <builtin>.isinstance
    - numpy.random.mtrand._rand.integers
    - warnings.warn
    - numpy.random.mtrand._rand.randint
    - random.Random.randint
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: random.Random.randint
    functionSourceFile: random
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - scale
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 430
    functionName: networkx.utils.misc.PythonRandomInterface.expovariate
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - numpy.random.mtrand._rand.exponential
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.exponential
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - shape
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 434
    functionName: networkx.utils.misc.PythonRandomInterface.paretovariate
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - numpy.random.mtrand._rand.pareto
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.random.mtrand._rand.pareto
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55b50>
    argNames:
    - random_state
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 449
    functionName: networkx.utils.misc.create_py_random_state
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - networkx.utils.misc.PythonRandomInterface.__init__
    - random.Random
    - networkx.utils.misc.PythonRandomViaNumpyBits.__init__
    - <builtin>.isinstance
    - warnings.warn
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: random.Random
    functionSourceFile: random
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - nodes1
    - nodes2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 515
    functionName: networkx.utils.misc.nodes_equal
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - <builtin>.dict
    - dict.fromkeys
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dict.fromkeys
    functionSourceFile: <builtin>
    functionUses: 246
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - edges1
    - edges2
    - directed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 542
    functionName: networkx.utils.misc.edges_equal
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - itertools.zip_longest
    - <builtin>.all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.zip_longest
    functionSourceFile: itertools
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - graph1
    - graph2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 623
    functionName: networkx.utils.misc.graphs_equal
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 645
    functionName: networkx.utils.misc._clear_cache
    functionSourceFile: networkx.utils.misc
    functionUses: 0
    functionsReached:
    - <builtin>.getattr
    - cache.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache.clear
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 4
    argDefaultValues: []
    argNames:
    - create_using
    - directed
    - multigraph
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 654
    functionName: networkx.utils.misc.check_create_using
    functionSourceFile: networkx.utils.misc
    functionUses: 19
    functionsReached:
    - <builtin>.isinstance
    - G.is_multigraph
    - G.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.utils.decorators
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph_types
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 24
    functionName: networkx.utils.decorators.not_implemented_for
    functionSourceFile: networkx.utils.decorators
    functionUses: 223
    functionsReached:
    - <builtin>.set
    - networkx.utils.decorators.argmap.__init__
    linkageType: pythonLinkage
    raised:
    - ValueError
    - KeyError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - g
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.utils.decorators.not_implemented_for._not_implemented_for
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - g.is_multigraph
    - g.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.is_directed
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.decorators.<lambda1>
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35e580>
    argNames:
    - path_arg
    - mode
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 104
    functionName: networkx.utils.decorators.open_file
    functionSourceFile: networkx.utils.decorators
    functionUses: 14
    functionsReached:
    - networkx.utils.decorators.argmap.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 180
    functionName: networkx.utils.decorators.open_file._open_file
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - os.path.splitext
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: os.path.splitext
    functionSourceFile: os
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.decorators.open_file._open_file.<lambda1>
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.utils.decorators.open_file._open_file.<lambda2>
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - fobj.close
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: fobj.close
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - which_args
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 200
    functionName: networkx.utils.decorators.nodes_or_number
    functionSourceFile: networkx.utils.decorators
    functionUses: 3
    functionsReached:
    - <builtin>.iter
    - networkx.utils.decorators.argmap.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 246
    functionName: networkx.utils.decorators.nodes_or_number._nodes_or_number
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - <builtin>.tuple
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - func
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 716
    functionName: networkx.utils.decorators.argmap._lazy_compile
    functionSourceFile: networkx.utils.decorators
    functionUses: 1
    functionsReached:
    - func.__dict__.update
    - func.__argmap__.compile
    - func.__globals__.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: func.__argmap__.compile
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: func.__globals__.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: func.__dict__.update
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - f
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 762
    functionName: networkx.utils.decorators.argmap.__call__
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - inspect.isgeneratorfunction
    - func.__dict__.update
    - func.__kwdefaults__.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - args
    - __wrapper
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 783
    functionName: networkx.utils.decorators.argmap.__call__.func
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - func.__dict__.update
    - networkx.utils.decorators.argmap._lazy_compile
    - func.__argmap__.compile
    - func.__globals__.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: func.__kwdefaults__.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: inspect.isgeneratorfunction
    functionSourceFile: inspect
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - cls
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 827
    functionName: networkx.utils.decorators.argmap._count
    functionSourceFile: networkx.utils.decorators
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: re.compile
    functionSourceFile: re
    functionUses: 150
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - f
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 850
    functionName: networkx.utils.decorators.argmap._name
    functionSourceFile: networkx.utils.decorators
    functionUses: 3
    functionsReached:
    - networkx.utils.decorators.argmap._count
    - <builtin>.hasattr
    - re.sub
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: re.sub
    functionSourceFile: re
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - f
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 869
    functionName: networkx.utils.decorators.argmap.compile
    functionSourceFile: networkx.utils.decorators
    functionUses: 0
    functionsReached:
    - networkx.utils.decorators.argmap._flatten
    - <builtin>.exec
    - mapblock.append
    - <builtin>.enumerate
    - <builtin>.map
    - <builtin>.id
    - networkx.utils.decorators.argmap.assemble.get_name
    - networkx.utils.decorators.argmap._count
    - networkx.utils.decorators.argmap._indent
    - functions.values
    - applied.add
    - networkx.utils.decorators.argmap.assemble
    - <builtin>.set
    - def_sig.append
    - call_sig.append
    - inspect.signature
    - networkx.utils.decorators.argmap.signature
    - <builtin>.hasattr
    - sig.call_sig.format
    - <builtin>.isinstance
    - networkx.utils.decorators.argmap.compile
    - visited.add
    - mapblock.extend
    - sig.parameters.values
    - <builtin>.dict
    - networkx.utils.decorators.argmap._name
    - re.sub
    - f.__argmap__.assemble
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - f
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 917
    functionName: networkx.utils.decorators.argmap.assemble
    functionSourceFile: networkx.utils.decorators
    functionUses: 1
    functionsReached:
    - mapblock.append
    - <builtin>.enumerate
    - <builtin>.map
    - <builtin>.id
    - networkx.utils.decorators.argmap.assemble.get_name
    - networkx.utils.decorators.argmap._count
    - applied.add
    - <builtin>.set
    - def_sig.append
    - call_sig.append
    - inspect.signature
    - networkx.utils.decorators.argmap.signature
    - <builtin>.hasattr
    - <builtin>.isinstance
    - mapblock.extend
    - sig.parameters.values
    - <builtin>.dict
    - networkx.utils.decorators.argmap._name
    - re.sub
    - f.__argmap__.assemble
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sig.call_sig.format
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1196
    functionName: networkx.utils.decorators.argmap._indent
    functionSourceFile: networkx.utils.decorators
    functionUses: 1
    functionsReached:
    - networkx.utils.decorators.argmap._flatten
    - visited.add
    - <builtin>.set
    - <builtin>.isinstance
    - <builtin>.id
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: functions.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.exec
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: f.__argmap__.assemble
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 6
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - f
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1060
    functionName: networkx.utils.decorators.argmap.signature
    functionSourceFile: networkx.utils.decorators
    functionUses: 2
    functionsReached:
    - networkx.utils.decorators.argmap._count
    - <builtin>.hasattr
    - sig.parameters.values
    - networkx.utils.decorators.argmap._name
    - re.sub
    - call_sig.append
    - inspect.signature
    - <builtin>.enumerate
    - def_sig.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.id
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0f9d0>
    argNames:
    - arg
    - first
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1008
    functionName: networkx.utils.decorators.argmap.assemble.get_name
    functionSourceFile: networkx.utils.decorators
    functionUses: 2
    functionsReached:
    - <builtin>.isinstance
    - networkx.utils.decorators.argmap.assemble.get_name
    - applied.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: applied.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapblock.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapblock.extend
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: def_sig.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: call_sig.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.namedtuple
    functionSourceFile: collections
    functionUses: 236
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - nestlist
    - visited
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1166
    functionName: networkx.utils.decorators.argmap._flatten
    functionSourceFile: networkx.utils.decorators
    functionUses: 2
    functionsReached:
    - <builtin>.isinstance
    - networkx.utils.decorators.argmap._flatten
    - visited.add
    - <builtin>.id
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: visited.add
    functionSourceFile: <builtin>
    functionUses: 220
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.heaps
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 26
    functionName: networkx.utils.heaps.MinHeap._Item.__init__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 30
    functionName: networkx.utils.heaps.MinHeap._Item.__repr__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - <builtin>.repr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.repr
    functionSourceFile: <builtin>
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 33
    functionName: networkx.utils.heaps.MinHeap.__init__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 37
    functionName: networkx.utils.heaps.MinHeap.min
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 52
    functionName: networkx.utils.heaps.MinHeap.pop
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448e20>
    argNames:
    - self
    - key
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 67
    functionName: networkx.utils.heaps.MinHeap.get
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb04d60>
    argNames:
    - self
    - key
    - value
    - allow_increase
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 86
    functionName: networkx.utils.heaps.MinHeap.insert
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 109
    functionName: networkx.utils.heaps.MinHeap.__nonzero__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 113
    functionName: networkx.utils.heaps.MinHeap.__bool__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 117
    functionName: networkx.utils.heaps.MinHeap.__len__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 121
    functionName: networkx.utils.heaps.MinHeap.__contains__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - key
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 144
    functionName: networkx.utils.heaps.PairingHeap._Node.__init__
    functionSourceFile: networkx.utils.heaps
    functionUses: 1
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.super
    functionSourceFile: <builtin>
    functionUses: 258
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 155
    functionName: networkx.utils.heaps.PairingHeap.__init__
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 160
    functionName: networkx.utils.heaps.PairingHeap.min
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 165
    functionName: networkx.utils.heaps.PairingHeap.pop
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - networkx.utils.heaps.PairingHeap._link
    - networkx.utils.heaps.PairingHeap._merge_children
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 228
    functionName: networkx.utils.heaps.PairingHeap._merge_children
    functionSourceFile: networkx.utils.heaps
    functionUses: 2
    functionsReached:
    - networkx.utils.heaps.PairingHeap._link
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc84f0>
    argNames:
    - self
    - key
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 173
    functionName: networkx.utils.heaps.PairingHeap.get
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb9d0>
    argNames:
    - self
    - key
    - value
    - allow_increase
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 177
    functionName: networkx.utils.heaps.PairingHeap.insert
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - networkx.utils.heaps.PairingHeap._cut
    - networkx.utils.heaps.PairingHeap._Node.__init__
    - <builtin>.super
    - networkx.utils.heaps.PairingHeap._link
    - networkx.utils.heaps.PairingHeap._merge_children
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 266
    functionName: networkx.utils.heaps.PairingHeap._cut
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - root
    - other
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 213
    functionName: networkx.utils.heaps.PairingHeap._link
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 284
    functionName: networkx.utils.heaps.BinaryHeap.__init__
    functionSourceFile: networkx.utils.heaps
    functionUses: 4
    functionsReached:
    - <builtin>.super
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.count
    functionSourceFile: itertools
    functionUses: 246
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 290
    functionName: networkx.utils.heaps.BinaryHeap.min
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached:
    - heapq.heappop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: heapq.heappop
    functionSourceFile: heapq
    functionUses: 243
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 304
    functionName: networkx.utils.heaps.BinaryHeap.pop
    functionSourceFile: networkx.utils.heaps
    functionUses: 196
    functionsReached:
    - heapq.heappop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5e1d90>
    argNames:
    - self
    - key
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 319
    functionName: networkx.utils.heaps.BinaryHeap.get
    functionSourceFile: networkx.utils.heaps
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf83a30>
    argNames:
    - self
    - key
    - value
    - allow_increase
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 322
    functionName: networkx.utils.heaps.BinaryHeap.insert
    functionSourceFile: networkx.utils.heaps
    functionUses: 194
    functionsReached:
    - <builtin>.next
    - heapq.heappush
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: heapq.heappush
    functionSourceFile: heapq
    functionUses: 240
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.union_find
    functionSourceFile: networkx.utils.union_find
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63dca0>
    argNames:
    - self
    - elements
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 31
    functionName: networkx.utils.union_find.UnionFind.__init__
    functionSourceFile: networkx.utils.union_find
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - object
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 46
    functionName: networkx.utils.union_find.UnionFind.__getitem__
    functionSourceFile: networkx.utils.union_find
    functionUses: 0
    functionsReached:
    - path.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.append
    functionSourceFile: <builtin>
    functionUses: 257
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 68
    functionName: networkx.utils.union_find.UnionFind.__iter__
    functionSourceFile: networkx.utils.union_find
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 72
    functionName: networkx.utils.union_find.UnionFind.to_sets
    functionSourceFile: networkx.utils.union_find
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - <builtin>.dict
    - networkx.utils.misc.groups
    - many_to_one.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - objects
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 91
    functionName: networkx.utils.union_find.UnionFind.union
    functionSourceFile: networkx.utils.union_find
    functionUses: 208
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - <builtin>.sorted
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.union_find.UnionFind.union.<lambda1>
    functionSourceFile: networkx.utils.union_find
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.rcm
    functionSourceFile: networkx.utils.rcm
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb04c40>
    argNames:
    - G
    - heuristic
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 15
    functionName: networkx.utils.rcm.cuthill_mckee_ordering
    functionSourceFile: networkx.utils.rcm
    functionUses: 11
    functionsReached:
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - visited.update
    - G.subgraph
    - <builtin>.max
    - operator.itemgetter
    - <builtin>.set
    - collections.deque.extend
    - <builtin>.next
    - networkx.shortest_path_length
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.iter
    - <builtin>.isinstance
    - spl.values
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - collections.deque.popleft
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.connected_components
    functionSourceFile: ''
    functionUses: 245
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.subgraph
    functionSourceFile: <builtin>
    functionUses: 251
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc5b6a0>
    argNames:
    - G
    - heuristic
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 128
    functionName: networkx.utils.rcm.connected_cuthill_mckee_ordering
    functionSourceFile: networkx.utils.rcm
    functionUses: 12
    functionsReached:
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - visited.update
    - <builtin>.max
    - operator.itemgetter
    - <builtin>.set
    - collections.deque.extend
    - <builtin>.next
    - networkx.shortest_path_length
    - <builtin>.iter
    - <builtin>.isinstance
    - spl.values
    - collections.deque
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - collections.deque.popleft
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc61400>
    argNames:
    - G
    - heuristic
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 72
    functionName: networkx.utils.rcm.reverse_cuthill_mckee_ordering
    functionSourceFile: networkx.utils.rcm
    functionUses: 10
    functionsReached:
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - visited.update
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - operator.itemgetter
    - <builtin>.set
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - spl.values
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - collections.deque.popleft
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 145
    functionName: networkx.utils.rcm.pseudo_peripheral_node
    functionSourceFile: networkx.utils.rcm
    functionUses: 13
    functionsReached:
    - networkx.shortest_path_length
    - networkx.utils.arbitrary_element
    - <builtin>.max
    - spl.items
    - <builtin>.min
    - <builtin>.iter
    - operator.itemgetter
    - <builtin>.isinstance
    - G.degree
    - <builtin>.next
    - spl.values
    - networkx.utils.misc.arbitrary_element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque
    functionSourceFile: collections
    functionUses: 266
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque.popleft
    functionSourceFile: collections
    functionUses: 255
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: operator.itemgetter
    functionSourceFile: operator
    functionUses: 224
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: visited.update
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque.extend
    functionSourceFile: collections
    functionUses: 207
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: spl.values
    functionSourceFile: <builtin>
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: spl.items
    functionSourceFile: <builtin>
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.drawing.nx_latex
    functionSourceFile: networkx.drawing.nx_latex
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.open_file
    - networkx.utils.not_implemented_for
    - networkx.utils.decorators.argmap
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.not_implemented_for
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 1
    IfCount: 12
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e3d0>
    - <ast.Constant object at 0x7f734a65e970>
    - <ast.Constant object at 0x7f734a65e610>
    - <ast.Constant object at 0x7f734a65e670>
    - <ast.Constant object at 0x7f734a65e8b0>
    - <ast.Constant object at 0x7f734a65e700>
    - <ast.Constant object at 0x7f734a65ea60>
    - <ast.Constant object at 0x7f734a65e250>
    - <ast.Constant object at 0x7f734a65e1f0>
    argNames:
    - G
    - pos
    - tikz_options
    - default_node_options
    - node_options
    - node_label
    - default_edge_options
    - edge_options
    - edge_label
    - edge_label_options
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 140
    functionName: networkx.drawing.nx_latex.to_latex_raw
    functionSourceFile: networkx.drawing.nx_latex
    functionUses: 2
    functionsReached:
    - G.is_directed
    - <builtin>.round
    - networkx.get_node_attributes
    - <builtin>.len
    - networkx.get_edge_attributes
    - default_node_options.strip
    - tikz_options.strip
    - <builtin>.enumerate
    - <builtin>.isinstance
    - default_edge_options.strip
    - els.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.round
    functionSourceFile: <builtin>
    functionUses: 209
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.get_edge_attributes
    functionSourceFile: ''
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tikz_options.strip
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: default_node_options.strip
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: default_edge_options.strip
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: els.strip
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 19
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf92490>
    - <ast.Constant object at 0x7f734cf92ac0>
    - <ast.Constant object at 0x7f734a4783d0>
    - <ast.Constant object at 0x7f734a478370>
    - <ast.Constant object at 0x7f734a4781f0>
    - <ast.Constant object at 0x7f734a478e50>
    - <ast.Constant object at 0x7f734a478eb0>
    - <ast.Constant object at 0x7f734a478430>
    - <ast.Constant object at 0x7f734a478190>
    - <ast.Constant object at 0x7f734a478d90>
    - <ast.Constant object at 0x7f734a4783a0>
    - <ast.Constant object at 0x7f734a478f40>
    - <ast.Constant object at 0x7f734a478df0>
    - <ast.Constant object at 0x7f734a4784f0>
    - <ast.Constant object at 0x7f734a478250>
    - <ast.Name object at 0x7f734a478f70>
    - <ast.Name object at 0x7f734a478cd0>
    - <ast.Name object at 0x7f734a478460>
    argNames:
    - Gbunch
    - pos
    - tikz_options
    - default_node_options
    - node_options
    - node_label
    - default_edge_options
    - edge_options
    - edge_label
    - edge_label_options
    - caption
    - latex_label
    - sub_captions
    - sub_labels
    - n_rows
    - as_document
    - document_wrapper
    - figure_wrapper
    - subfigure_wrapper
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 310
    functionName: networkx.drawing.nx_latex.to_latex
    functionSourceFile: networkx.drawing.nx_latex
    functionUses: 1
    functionsReached:
    - G.is_directed
    - <builtin>.hasattr
    - networkx.drawing.nx_latex.to_latex_raw
    - sbf.format
    - <builtin>.round
    - networkx.get_node_attributes
    - document_wrapper.format
    - <builtin>.zip
    - <builtin>.len
    - default_node_options.strip
    - networkx.get_edge_attributes
    - tikz_options.strip
    - <builtin>.enumerate
    - figure_wrapper.format
    - <builtin>.isinstance
    - default_edge_options.strip
    - els.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sbf.format
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: figure_wrapper.format
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: document_wrapper.format
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - Gbunch
    - path
    - options
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 481
    functionName: networkx.drawing.nx_latex.write_latex
    functionSourceFile: networkx.drawing.nx_latex
    functionUses: 0
    functionsReached:
    - document_wrapper.format
    - <builtin>.zip
    - tikz_options.strip
    - <builtin>.enumerate
    - default_edge_options.strip
    - els.strip
    - path.write
    - networkx.get_node_attributes
    - <builtin>.len
    - figure_wrapper.format
    - G.is_directed
    - <builtin>.hasattr
    - networkx.drawing.nx_latex.to_latex_raw
    - sbf.format
    - default_node_options.strip
    - <builtin>.isinstance
    - networkx.drawing.nx_latex.to_latex
    - <builtin>.round
    - networkx.get_edge_attributes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.write
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.drawing.nx_pylab
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7349c37fd0>
    - <ast.Constant object at 0x7f7349c37fa0>
    - <ast.Constant object at 0x7f7349c37f70>
    argNames:
    - G
    - src_attr
    - dest_attr
    - map
    - vmin
    - vmax
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 48
    functionName: networkx.drawing.nx_pylab.apply_matplotlib_colors
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.max
    - G.nodes
    - <builtin>.tuple
    - <builtin>.min
    - matplotlib.cm.ScalarMappable
    - mapper.set_clim
    - mapper.to_rgba
    - networkx.set_edge_attributes
    - G.is_multigraph
    - <builtin>.float
    - networkx.set_node_attributes
    - networkx.drawing.nx_pylab.apply_matplotlib_colors.do_map
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.cm.ScalarMappable
    functionSourceFile: matplotlib
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapper.set_clim
    functionSourceFile: <builtin>
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 101
    functionName: networkx.drawing.nx_pylab.apply_matplotlib_colors.do_map
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - mapper.to_rgba
    - <builtin>.tuple
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapper.to_rgba
    functionSourceFile: <builtin>
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.set_edge_attributes
    functionSourceFile: ''
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 7
    argDefaultValues: []
    argNames:
    - self
    - arrow
    - args
    - label_pos
    - labels_horizontal
    - ax
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 116
    functionName: networkx.drawing.nx_pylab.CurvedArrowTextBase.__init__
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 2
    functionsReached:
    - <builtin>.range
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._update_text_pos_angle
    - arrow.get_connectionstyle
    - trans_data.transform
    - plt.gca
    - numpy.arctan2
    - <builtin>.sum
    - <builtin>.type
    - <builtin>.super
    - <builtin>.len
    - math.dist
    - <builtin>.enumerate
    - <builtin>.isinstance
    - arrow._convert_xy_units
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: plt.gca
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 0
    IfCount: 8
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - arrow
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 170
    functionName: networkx.drawing.nx_pylab.CurvedArrowTextBase._update_text_pos_angle
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 4
    functionsReached:
    - <builtin>.range
    - arrow.get_connectionstyle
    - trans_data.transform
    - numpy.arctan2
    - <builtin>.sum
    - <builtin>.type
    - <builtin>.len
    - math.dist
    - <builtin>.enumerate
    - <builtin>.isinstance
    - arrow._convert_xy_units
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - arrow
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 141
    functionName: networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 5
    functionsReached:
    - arrow._convert_xy_units
    - arrow.get_connectionstyle
    - trans_data.transform
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arrow._convert_xy_units
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: trans_data.transform
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arrow.get_connectionstyle
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.dist
    functionSourceFile: math
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.arctan2
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - renderer
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 248
    functionName: networkx.drawing.nx_pylab.CurvedArrowTextBase.draw
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._update_text_pos_angle
    - arrow.get_connectionstyle
    - trans_data.transform
    - numpy.arctan2
    - <builtin>.sum
    - <builtin>.type
    - <builtin>.super
    - <builtin>.len
    - math.dist
    - <builtin>.enumerate
    - <builtin>.isinstance
    - arrow._convert_xy_units
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 24
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 13
    EdgeCount: 35
    ICount: 14
    IfCount: 24
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0fa60>
    argNames:
    - G
    - canvas
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 257
    functionName: networkx.drawing.nx_pylab.display
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - canvas.transData.inverted
    - kwargs.items
    - arrow.get_connectionstyle
    - trans_data.transform
    - <builtin>.zip
    - canvas.add_collection
    - numpy.sqrt
    - <builtin>.sum
    - networkx.drawing.nx_pylab.display.compute_colors
    - <builtin>.str
    - <builtin>.enumerate
    - edge_subgraph.is_multigraph
    - canvas.text
    - networkx.remove_node_attributes
    - networkx.set_node_attributes
    - networkx.drawing.nx_pylab.display.self_loop
    - <builtin>.any
    - networkx.drawing.nx_pylab.display.edge_property_sequence
    - lbl.update
    - matplotlib.colors.colorConverter.to_rgba
    - networkx.get_node_attributes
    - G.subgraph
    - <builtin>.max
    - <builtin>.type
    - <builtin>.len
    - node_subgraph.nodes
    - G.is_directed
    - lbl.get
    - networkx.drawing.nx_pylab.display.build_fancy_arrow
    - kwargs.get
    - matplotlib.patches.FancyArrowPatch
    - numpy.asarray
    - numpy.arctan2
    - <builtin>.tuple
    - canvas.add_patch
    - canvas.tick_params
    - matplotlib.pyplot.gca
    - networkx.drawing.nx_pylab.display.collection_compatible
    - networkx.drawing.nx_pylab.display.to_marker_edge
    - networkx.drawing.nx_pylab.display.get_node_attr
    - <builtin>.callable
    - <builtin>.isinstance
    - arrow._convert_xy_units
    - networkx.spring_layout
    - networkx.drawing.nx_pylab.display.node_property_sequence
    - collections.Counter
    - G.edges
    - networkx.drawing.nx_pylab.display.get_edge_attr
    - networkx.drawing.nx_pylab.CurvedArrowTextBase.__init__
    - <builtin>.range
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._update_text_pos_angle
    - matplotlib.collections.LineCollection
    - plt.gca
    - G.nodes
    - G.edge_subgraph
    - canvas.scatter
    - kwargs.values
    - edge_subgraph.edges
    - canvas.transData.transform
    - <builtin>.super
    - networkx.get_edge_attributes
    - math.dist
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.pyplot.gca
    functionSourceFile: matplotlib
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.tick_params
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - seq
    - attr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 599
    functionName: networkx.drawing.nx_pylab.display.node_property_sequence
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - kwargs.items
    - kwargs.get
    - networkx.get_node_attributes
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 0
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - color
    - alpha
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 625
    functionName: networkx.drawing.nx_pylab.display.compute_colors
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - matplotlib.colors.colorConverter.to_rgba
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.colors.colorConverter.to_rgba
    functionSourceFile: matplotlib
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - e
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 650
    functionName: networkx.drawing.nx_pylab.display.collection_compatible
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - kwargs.values
    - networkx.get_edge_attributes
    - kwargs.get
    - networkx.drawing.nx_pylab.display.get_edge_attr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - e
    - attr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 682
    functionName: networkx.drawing.nx_pylab.display.get_edge_attr
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 3
    functionsReached:
    - networkx.get_edge_attributes
    - kwargs.get
    - kwargs.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - seq
    - attr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 660
    functionName: networkx.drawing.nx_pylab.display.edge_property_sequence
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - kwargs.items
    - networkx.get_edge_attributes
    - kwargs.get
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kwargs.values
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e9a0>
    argNames:
    - n
    - attr
    - use_edge_subgraph
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 701
    functionName: networkx.drawing.nx_pylab.display.get_node_attr
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 2
    functionsReached:
    - kwargs.get
    - kwargs.values
    - networkx.get_node_attributes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - edge_index
    - node_size
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 722
    functionName: networkx.drawing.nx_pylab.display.self_loop
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - posA
    - posB
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 723
    functionName: networkx.drawing.nx_pylab.display.self_loop.self_loop_connection
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - canvas.transData.inverted
    - <builtin>.range
    - numpy.asarray
    - numpy.array
    - numpy.sqrt
    - canvas.transData.transform
    - matplotlib.path.Path
    - numpy.all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.all
    functionSourceFile: numpy
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.transData.inverted
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.transData.transform
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.path.Path
    functionSourceFile: matplotlib
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - size
    - marker
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 764
    functionName: networkx.drawing.nx_pylab.display.to_marker_edge
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 2
    functionsReached:
    - numpy.sqrt
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - e
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 770
    functionName: networkx.drawing.nx_pylab.display.build_fancy_arrow
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - matplotlib.patches.FancyArrowPatch
    - kwargs.get
    - networkx.get_node_attributes
    - <builtin>.max
    - kwargs.values
    - numpy.sqrt
    - <builtin>.len
    - networkx.drawing.nx_pylab.display.to_marker_edge
    - networkx.drawing.nx_pylab.display.get_node_attr
    - networkx.get_edge_attributes
    - networkx.drawing.nx_pylab.display.self_loop
    - networkx.drawing.nx_pylab.display.get_edge_attr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.patches.FancyArrowPatch
    functionSourceFile: matplotlib
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.spring_layout
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter
    functionSourceFile: collections
    functionUses: 228
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_subgraph.nodes
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.scatter
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lbl.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lbl.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.text
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.edge_subgraph
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_subgraph.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_subgraph.edges
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.collections.LineCollection
    functionSourceFile: matplotlib
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.add_collection
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: canvas.add_patch
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.remove_node_attributes
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d521460>
    - <ast.Constant object at 0x7f734d521430>
    argNames:
    - G
    - pos
    - ax
    - kwds
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1091
    functionName: networkx.drawing.nx_pylab.draw
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 9
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.pyplot.gcf
    functionSourceFile: matplotlib
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.get_figure
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cf.set_facecolor
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cf.gca
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cf.add_axes
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d5252e0>
    - <ast.Constant object at 0x7f734d5252b0>
    - <ast.Constant object at 0x7f734d525280>
    argNames:
    - G
    - pos
    - arrows
    - with_labels
    - kwds
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1170
    functionName: networkx.drawing.nx_pylab.draw_networkx
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 10
    functionsReached:
    - matplotlib.pyplot.draw_if_interactive
    - node_collection.set_zorder
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - msg.format
    - <builtin>.str
    - itertools.islice
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - warnings.warn
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - ax.margins
    - <builtin>.any
    - kwds.items
    - numpy.ravel
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - <builtin>.max
    - numpy.array
    - mapper.set_clim
    - <builtin>.len
    - numpy.resize
    - <builtin>.set
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - inspect.signature
    - <builtin>.next
    - edge_collection.set_clim
    - G.is_directed
    - matplotlib.pyplot.get_cmap
    - ax.add_patch
    - ax.update_datalim
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - ax.tick_params
    - matplotlib.collections.PathCollection
    - ax.text
    - numpy.asarray
    - edge_viz_obj.append
    - labels.items
    - <builtin>.tuple
    - edgelist_tuple.index
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - numpy.unique
    - <builtin>.list
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - <builtin>.isinstance
    - numpy.amin
    - edge_collection.set_label
    - ax.scatter
    - matplotlib.colors.colorConverter.to_rgba_array
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - collections.defaultdict
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - edge_collection.set_cmap
    - edge_collection.set_zorder
    - numpy.iterable
    - G.nodes
    - <builtin>.min
    - itertools.cycle
    - individual_params.add
    - matplotlib.cm.ScalarMappable
    - numpy.amax
    - ax.autoscale_view
    - ax.add_collection
    - numpy.all
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.set_axis_off
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.pyplot.draw_if_interactive
    functionSourceFile: matplotlib
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: inspect.signature.parameters.keys
    functionSourceFile: inspect
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kwds.items
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.drawing.spring_layout
    functionSourceFile: ''
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 5
    IfCount: 8
    argCount: 16
    argDefaultValues:
    - <ast.Constant object at 0x7f734703cdc0>
    - <ast.Constant object at 0x7f734703cd90>
    - <ast.Constant object at 0x7f734703cd60>
    - <ast.Constant object at 0x7f734703cd30>
    - <ast.Constant object at 0x7f734703cd00>
    - <ast.Constant object at 0x7f734703ccd0>
    - <ast.Constant object at 0x7f734703cca0>
    - <ast.Constant object at 0x7f734703cc70>
    - <ast.Constant object at 0x7f734703cc40>
    - <ast.Constant object at 0x7f734703cc10>
    - <ast.Constant object at 0x7f734703cbe0>
    - <ast.Constant object at 0x7f734703cbb0>
    - <ast.Constant object at 0x7f734703cb80>
    - <ast.Constant object at 0x7f734703cb50>
    argNames:
    - G
    - pos
    - nodelist
    - node_size
    - node_color
    - node_shape
    - alpha
    - cmap
    - vmin
    - vmax
    - ax
    - linewidths
    - edgecolors
    - label
    - margins
    - hide_ticks
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1359
    functionName: networkx.drawing.nx_pylab.draw_networkx_nodes
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 11
    functionsReached:
    - node_collection.set_zorder
    - mapper.to_rgba
    - itertools.islice
    - networkx.drawing.nx_pylab.apply_alpha
    - ax.margins
    - matplotlib.colors.colorConverter.to_rgba
    - numpy.array
    - mapper.set_clim
    - <builtin>.len
    - numpy.resize
    - ax.tick_params
    - matplotlib.collections.PathCollection
    - numpy.asarray
    - numpy.unique
    - <builtin>.list
    - matplotlib.pyplot.gca
    - <builtin>.isinstance
    - ax.scatter
    - <builtin>.range
    - matplotlib.cm.ScalarMappable
    - itertools.cycle
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 24
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 13
    EdgeCount: 35
    ICount: 18
    IfCount: 24
    argCount: 22
    argDefaultValues:
    - <ast.Constant object at 0x7f734867d4c0>
    - <ast.Constant object at 0x7f734867d490>
    - <ast.Constant object at 0x7f734867d460>
    - <ast.Constant object at 0x7f734867d430>
    - <ast.Constant object at 0x7f734867d400>
    - <ast.Constant object at 0x7f734867d3d0>
    - <ast.Constant object at 0x7f734867d3a0>
    - <ast.Constant object at 0x7f734867d370>
    - <ast.Constant object at 0x7f734867d340>
    - <ast.Constant object at 0x7f734867d310>
    - <ast.Constant object at 0x7f734867d2e0>
    - <ast.Constant object at 0x7f734867d2b0>
    - <ast.Constant object at 0x7f734867d280>
    - <ast.Constant object at 0x7f734867d250>
    - <ast.Constant object at 0x7f734867d220>
    - <ast.Constant object at 0x7f734867d1f0>
    - <ast.Constant object at 0x7f734867d1c0>
    - <ast.Constant object at 0x7f734867d190>
    - <ast.Constant object at 0x7f734867d160>
    - <ast.Constant object at 0x7f734867d130>
    argNames:
    - G
    - pos
    - edgelist
    - width
    - edge_color
    - style
    - alpha
    - arrowstyle
    - arrowsize
    - edge_cmap
    - edge_vmin
    - edge_vmax
    - ax
    - arrows
    - label
    - node_size
    - nodelist
    - node_shape
    - connectionstyle
    - min_source_margin
    - min_target_margin
    - hide_ticks
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1748
    functionName: networkx.drawing.nx_pylab.draw_networkx_edges
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 11
    functionsReached:
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - msg.format
    - <builtin>.map
    - warnings.warn
    - <builtin>.any
    - numpy.ravel
    - matplotlib.colors.Normalize
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - <builtin>.max
    - numpy.array
    - <builtin>.len
    - matplotlib.patches.ConnectionStyle
    - <builtin>.next
    - edge_collection.set_clim
    - G.is_directed
    - matplotlib.pyplot.get_cmap
    - ax.add_patch
    - ax.update_datalim
    - ax.tick_params
    - numpy.asarray
    - edge_viz_obj.append
    - <builtin>.tuple
    - edgelist_tuple.index
    - <builtin>.list
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - <builtin>.isinstance
    - numpy.amin
    - edge_collection.set_label
    - matplotlib.colors.colorConverter.to_rgba_array
    - collections.defaultdict
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - edge_collection.set_cmap
    - edge_collection.set_zorder
    - numpy.iterable
    - G.nodes
    - <builtin>.min
    - numpy.amax
    - ax.autoscale_view
    - ax.add_collection
    - numpy.all
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 7
    IfCount: 4
    argCount: 14
    argDefaultValues:
    - <ast.Constant object at 0x7f7348676c70>
    - <ast.Constant object at 0x7f7348676c40>
    - <ast.Constant object at 0x7f7348676c10>
    - <ast.Constant object at 0x7f7348676be0>
    - <ast.Constant object at 0x7f7348676bb0>
    - <ast.Constant object at 0x7f7348676b80>
    - <ast.Constant object at 0x7f7348676b50>
    - <ast.Constant object at 0x7f7348676b20>
    - <ast.Constant object at 0x7f7348676af0>
    - <ast.Constant object at 0x7f7348676ac0>
    - <ast.Constant object at 0x7f7348676a90>
    - <ast.Constant object at 0x7f7348676a60>
    argNames:
    - G
    - pos
    - labels
    - font_size
    - font_color
    - font_family
    - font_weight
    - alpha
    - bbox
    - horizontalalignment
    - verticalalignment
    - ax
    - clip_on
    - hide_ticks
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 2121
    functionName: networkx.drawing.nx_pylab.draw_networkx_labels
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 11
    functionsReached:
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - ax.tick_params
    - ax.text
    - labels.items
    - G.nodes
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - individual_params.add
    - matplotlib.pyplot.gca
    - <builtin>.len
    - <builtin>.set
    - <builtin>.str
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.collections.PathCollection
    functionSourceFile: matplotlib
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734820e9a0>
    - <ast.Constant object at 0x7f734820e9d0>
    - <ast.Constant object at 0x7f734820ea00>
    argNames:
    - colors
    - alpha
    - elem_list
    - cmap
    - vmin
    - vmax
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2902
    functionName: networkx.drawing.nx_pylab.apply_alpha
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 12
    functionsReached:
    - matplotlib.colors.colorConverter.to_rgba
    - numpy.array
    - matplotlib.cm.ScalarMappable
    - itertools.cycle
    - mapper.set_clim
    - mapper.to_rgba
    - <builtin>.len
    - numpy.resize
    - <builtin>.list
    - itertools.islice
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.unique
    functionSourceFile: numpy
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.scatter
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.tick_params
    functionSourceFile: <builtin>
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.margins
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_collection.set_zorder
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73470371c0>
    argNames:
    - self
    - connectionstyles
    - selfloop_height
    - ax
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1533
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 14
    functionsReached:
    - <builtin>.len
    - matplotlib.patches.ConnectionStyle
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.patches.ConnectionStyle
    functionSourceFile: matplotlib
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - edge_index
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1547
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.curved
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - edge_index
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1550
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.self_loop
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - posA
    - posB
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1551
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.self_loop.self_loop_connection
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - numpy.asarray
    - numpy.array
    - matplotlib.path.Path
    - numpy.all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 18
    argDefaultValues:
    - <ast.Constant object at 0x7f7347036b20>
    - <ast.Constant object at 0x7f7347036b50>
    - <ast.Constant object at 0x7f7347036b80>
    - <ast.Constant object at 0x7f7347036bb0>
    - <ast.Constant object at 0x7f7347036be0>
    - <ast.Constant object at 0x7f7347036c10>
    - <ast.Constant object at 0x7f7347036c40>
    - <ast.Constant object at 0x7f7347036c70>
    - <ast.Constant object at 0x7f7347036ca0>
    - <ast.Constant object at 0x7f7347036cd0>
    - <ast.Constant object at 0x7f7347036d00>
    argNames:
    - self
    - edge_pos
    - edgelist
    - nodelist
    - edge_indices
    - node_size
    - selfloop_height
    - connectionstyle
    - node_shape
    - arrowstyle
    - arrowsize
    - edge_color
    - alpha
    - linewidth
    - style
    - min_source_margin
    - min_target_margin
    - ax
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1590
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 13
    functionsReached:
    - numpy.iterable
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - <builtin>.list
    - <builtin>.len
    - matplotlib.patches.ConnectionStyle
    - <builtin>.isinstance
    - matplotlib.colors.colorConverter.to_rgba_array
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.iterable
    functionSourceFile: numpy
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.colors.colorConverter.to_rgba_array
    functionSourceFile: matplotlib
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 0
    IfCount: 12
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - i
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1644
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.__call__
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - matplotlib.patches.FancyArrowPatch
    - numpy.iterable
    - <builtin>.max
    - networkx.drawing.nx_pylab.FancyArrowFactory.to_marker_edge
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.curved
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.self_loop
    - numpy.sqrt
    - <builtin>.len
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - marker_size
    - marker
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1741
    functionName: networkx.drawing.nx_pylab.FancyArrowFactory.to_marker_edge
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - numpy.sqrt
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: msg.format
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.drawing.nx_pylab.draw_networkx_edges.<lambda1>
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.pyplot.get_cmap
    functionSourceFile: matplotlib
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matplotlib.colors.Normalize
    functionSourceFile: matplotlib
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.ravel
    functionSourceFile: numpy
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.amin
    functionSourceFile: numpy
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.amax
    functionSourceFile: numpy
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_collection.set_cmap
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_collection.set_clim
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_collection.set_zorder
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_collection.set_label
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.add_collection
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.selfloop_edges
    functionSourceFile: ''
    functionUses: 219
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgelist_tuple.index
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arrow_collection.append
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.add_patch
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_viz_obj.append
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.update_datalim
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.autoscale_view
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - p_value
    - p_name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2222
    functionName: networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 12
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - individual_params.add
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: individual_params.add
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - node
    - p_value
    - p_name
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 2228
    functionName: networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: labels.items
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.text
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 10
    IfCount: 12
    argCount: 19
    argDefaultValues:
    - <ast.Constant object at 0x7f7348215370>
    - <ast.Constant object at 0x7f73482153a0>
    - <ast.Constant object at 0x7f73482153d0>
    - <ast.Constant object at 0x7f7348215400>
    - <ast.Constant object at 0x7f7348215430>
    - <ast.Constant object at 0x7f7348215460>
    - <ast.Constant object at 0x7f7348215490>
    - <ast.Constant object at 0x7f73482154c0>
    - <ast.Constant object at 0x7f73482154f0>
    - <ast.Constant object at 0x7f7348215520>
    - <ast.Constant object at 0x7f7348215550>
    - <ast.Constant object at 0x7f7348215580>
    - <ast.Constant object at 0x7f73482155b0>
    - <ast.Constant object at 0x7f73482155e0>
    - <ast.Constant object at 0x7f7348215610>
    - <ast.Constant object at 0x7f7348215640>
    - <ast.Constant object at 0x7f7348215670>
    argNames:
    - G
    - pos
    - edge_labels
    - label_pos
    - font_size
    - font_color
    - font_family
    - font_weight
    - alpha
    - bbox
    - horizontalalignment
    - verticalalignment
    - ax
    - rotate
    - clip_on
    - node_size
    - nodelist
    - connectionstyle
    - hide_ticks
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 2274
    functionName: networkx.drawing.nx_pylab.draw_networkx_edge_labels
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - arrow.get_connectionstyle
    - trans_data.transform
    - <builtin>.zip
    - ax.transData.inverted
    - <builtin>.sum
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - networkx.drawing.nx_pylab.draw_networkx_edge_labels.check_individual_params
    - <builtin>.str
    - <builtin>.enumerate
    - numpy.ravel
    - p_value.iter
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - numpy.array
    - <builtin>.type
    - <builtin>.len
    - matplotlib.patches.ConnectionStyle
    - <builtin>.next
    - ax.tick_params
    - ax.text
    - numpy.asarray
    - numpy.arctan2
    - <builtin>.tuple
    - ax.transData.transform
    - <builtin>.list
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - <builtin>.isinstance
    - numpy.amin
    - arrow._convert_xy_units
    - matplotlib.colors.colorConverter.to_rgba_array
    - G.edges
    - networkx.drawing.nx_pylab.CurvedArrowTextBase.__init__
    - collections.defaultdict
    - <builtin>.range
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._update_text_pos_angle
    - numpy.iterable
    - plt.gca
    - G.nodes
    - <builtin>.super
    - numpy.amax
    - math.dist
    - networkx.drawing.nx_pylab.draw_networkx_edge_labels.get_param_value
    - edge_labels.items
    - networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_labels.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.drawing.nx_pylab.draw_networkx_edge_labels.<lambda1>
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - p_value
    - p_name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2453
    functionName: networkx.drawing.nx_pylab.draw_networkx_edge_labels.check_individual_params
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - p_value.iter
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p_value.iter
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - p_value
    - p_name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2461
    functionName: networkx.drawing.nx_pylab.draw_networkx_edge_labels.get_param_value
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 1
    functionsReached:
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.transData.transform
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ax.transData.inverted
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2546
    functionName: networkx.drawing.nx_pylab.draw_bipartite
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - networkx.bipartite_layout
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bipartite_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2590
    functionName: networkx.drawing.nx_pylab.draw_circular
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - networkx.circular_layout
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.circular_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2629
    functionName: networkx.drawing.nx_pylab.draw_kamada_kawai
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - networkx.kamada_kawai_layout
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.kamada_kawai_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2669
    functionName: networkx.drawing.nx_pylab.draw_random
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - networkx.random_layout
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2708
    functionName: networkx.drawing.nx_pylab.draw_spectral
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - networkx.spectral_layout
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.spectral_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2750
    functionName: networkx.drawing.nx_pylab.draw_spring
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - networkx.spring_layout
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7348237d30>
    argNames:
    - G
    - nlist
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2793
    functionName: networkx.drawing.nx_pylab.draw_shell
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.shell_layout
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.shell_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2838
    functionName: networkx.drawing.nx_pylab.draw_planar
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - networkx.planar_layout
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.planar_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 2882
    functionName: networkx.drawing.nx_pylab.draw_forceatlas2
    functionSourceFile: networkx.drawing.nx_pylab
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - itertools.islice
    - <builtin>.any
    - matplotlib.colors.Normalize
    - matplotlib.colors.colorConverter.to_rgba
    - <builtin>.max
    - cf.add_axes
    - inspect.signature.parameters.keys
    - networkx.drawing.spring_layout
    - matplotlib.patches.ConnectionStyle
    - ax.get_figure
    - networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value
    - matplotlib.pyplot.gca
    - G.is_multigraph
    - networkx.selfloop_edges
    - numpy.amin
    - ax.scatter
    - collections.defaultdict
    - cf.set_facecolor
    - edge_collection.set_zorder
    - individual_params.add
    - ax.add_collection
    - numpy.all
    - matplotlib.pyplot.draw_if_interactive
    - networkx.drawing.nx_pylab.draw_networkx_edges
    - mapper.to_rgba
    - msg.format
    - ax.margins
    - networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__
    - mapper.set_clim
    - <builtin>.set
    - edge_collection.set_clim
    - G.is_directed
    - ax.add_patch
    - ax.update_datalim
    - numpy.asarray
    - labels.items
    - edgelist_tuple.index
    - <builtin>.isinstance
    - edge_collection.set_label
    - networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params
    - <builtin>.min
    - ax.autoscale_view
    - warnings.warn
    - numpy.ravel
    - numpy.array
    - <builtin>.len
    - networkx.drawing.nx_pylab.draw_networkx_labels
    - matplotlib.collections.PathCollection
    - <builtin>.tuple
    - numpy.unique
    - <builtin>.range
    - arrow_collection.append
    - matplotlib.collections.LineCollection
    - numpy.iterable
    - G.nodes
    - matplotlib.cm.ScalarMappable
    - node_collection.set_zorder
    - cf.gca
    - ax.set_axis_off
    - networkx.drawing.nx_pylab.FancyArrowFactory.__init__
    - <builtin>.map
    - networkx.drawing.nx_pylab.apply_alpha
    - networkx.drawing.nx_pylab.draw_networkx_nodes
    - kwds.items
    - networkx.drawing.nx_pylab.draw_networkx
    - networkx.forceatlas2_layout
    - numpy.resize
    - matplotlib.pyplot.gcf
    - inspect.signature
    - <builtin>.next
    - matplotlib.pyplot.get_cmap
    - ax.tick_params
    - ax.text
    - edge_viz_obj.append
    - <builtin>.list
    - matplotlib.colors.colorConverter.to_rgba_array
    - edge_collection.set_cmap
    - networkx.drawing.nx_pylab.draw
    - itertools.cycle
    - numpy.amax
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.forceatlas2_layout
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.resize
    functionSourceFile: numpy
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.cycle
    functionSourceFile: itertools
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.islice
    functionSourceFile: itertools
    functionUses: 245
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.drawing.nx_pydot
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - path
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 39
    functionName: networkx.drawing.nx_pydot.write_dot
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 0
    functionsReached:
    - P.add_edge
    - N.is_directed
    - networkx.drawing.nx_pydot.to_pydot
    - P.set_node_defaults
    - <builtin>.str
    - edgedata.items
    - pydot.Dot
    - P.to_string
    - path.write
    - N.edges
    - nodedata.items
    - N.nodes
    - N.is_multigraph
    - pydot.Node
    - P.set_edge_defaults
    - networkx.number_of_selfloops
    - P.add_node
    - pydot.Edge
    - N.graph.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - N
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 185
    functionName: networkx.drawing.nx_pydot.to_pydot
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 3
    functionsReached:
    - P.add_edge
    - N.is_directed
    - N.nodes
    - N.is_multigraph
    - pydot.Node
    - P.set_edge_defaults
    - nodedata.items
    - P.set_node_defaults
    - <builtin>.str
    - networkx.number_of_selfloops
    - P.add_node
    - N.edges
    - edgedata.items
    - pydot.Dot
    - N.graph.get
    - pydot.Edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.to_string
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 57
    functionName: networkx.drawing.nx_pydot.read_dot
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 0
    functionsReached:
    - P.get_name
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - e.get_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - d.append
    - P.get_attributes
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - P.get_edge_defaults
    - <builtin>.len
    - pydot.graph_from_dot_data
    - P.get_strict
    - v.strip
    - attr_dict.update
    - s.append
    - vnodes.strip
    - path.read
    - u.strip
    - p.get_attributes
    - P.get_node_list
    - <builtin>.isinstance
    - p.get_name
    - networkx.classes.graph.Graph.add_node
    - networkx.drawing.nx_pydot.from_pydot
    - e.get_source
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - e.get_destination
    - P.get_type
    - P.get_edge_list
    - P.get_node_defaults
    - unodes.strip
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.read
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pydot.graph_from_dot_data
    functionSourceFile: pydot
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 7
    IfCount: 8
    argCount: 1
    argDefaultValues: []
    argNames:
    - P
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 92
    functionName: networkx.drawing.nx_pydot.from_pydot
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 1
    functionsReached:
    - P.get_name
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - e.get_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - d.append
    - P.get_attributes
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - P.get_edge_defaults
    - <builtin>.len
    - P.get_strict
    - v.strip
    - attr_dict.update
    - s.append
    - vnodes.strip
    - u.strip
    - p.get_attributes
    - P.get_node_list
    - <builtin>.isinstance
    - p.get_name
    - networkx.classes.graph.Graph.add_node
    - e.get_source
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - e.get_destination
    - P.get_type
    - P.get_edge_list
    - P.get_node_defaults
    - unodes.strip
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_strict
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_type
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_name
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_node_list
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p.get_name
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p.get_attributes
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_edge_list
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.get_source
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.get_destination
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.get_attributes
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u.strip
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: s.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unodes.strip
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v.strip
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vnodes.strip
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_attributes
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_node_defaults
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.get_edge_defaults
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pydot.Dot
    functionSourceFile: pydot
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.set_node_defaults
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.set_edge_defaults
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pydot.Node
    functionSourceFile: pydot
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.add_node
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pydot.Edge
    functionSourceFile: pydot
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.add_edge
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e9a0>
    - <ast.Constant object at 0x7f734a65edc0>
    argNames:
    - G
    - prog
    - root
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 250
    functionName: networkx.drawing.nx_pydot.graphviz_layout
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 0
    functionsReached:
    - P.add_edge
    - N.is_directed
    - networkx.drawing.nx_pydot.to_pydot
    - P.set_node_defaults
    - <builtin>.str
    - edgedata.items
    - Q.get_node
    - pydot.Dot
    - pos.split
    - <builtin>.len
    - pydot.graph_from_dot_data
    - N.edges
    - nodedata.items
    - N.nodes
    - N.is_multigraph
    - pydot.Node
    - P.set_edge_defaults
    - P.set
    - <builtin>.print
    - networkx.number_of_selfloops
    - P.add_node
    - <builtin>.float
    - <builtin>.isinstance
    - pydot.Edge
    - P.create_dot
    - node.get_pos
    - pydot.quote_id_if_necessary
    - G.nodes
    - networkx.drawing.nx_pydot.pydot_layout
    - locale.getpreferredencoding
    - N.graph.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 8
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65edf0>
    - <ast.Constant object at 0x7f734a65ea90>
    argNames:
    - G
    - prog
    - root
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 283
    functionName: networkx.drawing.nx_pydot.pydot_layout
    functionSourceFile: networkx.drawing.nx_pydot
    functionUses: 1
    functionsReached:
    - P.add_edge
    - N.is_directed
    - networkx.drawing.nx_pydot.to_pydot
    - P.set_node_defaults
    - <builtin>.str
    - edgedata.items
    - Q.get_node
    - pydot.Dot
    - pos.split
    - <builtin>.len
    - pydot.graph_from_dot_data
    - N.edges
    - nodedata.items
    - N.nodes
    - N.is_multigraph
    - pydot.Node
    - P.set_edge_defaults
    - P.set
    - <builtin>.print
    - networkx.number_of_selfloops
    - P.add_node
    - <builtin>.float
    - <builtin>.isinstance
    - pydot.Edge
    - P.create_dot
    - node.get_pos
    - pydot.quote_id_if_necessary
    - G.nodes
    - locale.getpreferredencoding
    - N.graph.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.set
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.create_dot
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: locale.getpreferredencoding
    functionSourceFile: locale
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pydot.quote_id_if_necessary
    functionSourceFile: pydot
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.get_node
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node.get_pos
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pos.split
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.linalg
    functionSourceFile: networkx.linalg
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.linalg.graphmatrix
    functionSourceFile: networkx.linalg.graphmatrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26070>
    - <ast.Constant object at 0x7f734cf266a0>
    - <ast.Constant object at 0x7f734cf26100>
    - <ast.Constant object at 0x7f734cf26eb0>
    argNames:
    - G
    - nodelist
    - edgelist
    - oriented
    - weight
    - dtype
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.linalg.graphmatrix.incidence_matrix
    functionSourceFile: networkx.linalg.graphmatrix
    functionUses: 0
    functionsReached:
    - A.asformat
    - <builtin>.list
    - <builtin>.len
    - G.is_multigraph
    - <builtin>.enumerate
    - scipy.sparse.lil_array
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.lil_array
    functionSourceFile: scipy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.asformat
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f2e0>
    - <ast.Constant object at 0x7f734b06f550>
    - <ast.Constant object at 0x7f734b06f910>
    argNames:
    - G
    - nodelist
    - dtype
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 109
    functionName: networkx.linalg.graphmatrix.adjacency_matrix
    functionSourceFile: networkx.linalg.graphmatrix
    functionUses: 0
    functionsReached:
    - networkx.to_scipy_sparse_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.linalg.algebraicconnectivity
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.utils.decorators.np_random_state
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - A
    - M
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 36
    functionName: networkx.linalg.algebraicconnectivity._PCGSolver.__init__
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - B
    - tol
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 40
    functionName: networkx.linalg.algebraicconnectivity._PCGSolver.solve
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 5
    functionsReached:
    - networkx.linalg.algebraicconnectivity._PCGSolver._solve
    - <builtin>.range
    - b.copy
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - numpy.asarray
    - numpy.ndarray
    - z.copy
    - scipy.linalg.blas.dasum
    - scipy.linalg.blas.ddot
    - scipy.linalg.blas.daxpy
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.ndarray
    functionSourceFile: numpy
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - b
    - tol
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 50
    functionName: networkx.linalg.algebraicconnectivity._PCGSolver._solve
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 6
    functionsReached:
    - b.copy
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - z.copy
    - scipy.linalg.blas.dasum
    - scipy.linalg.blas.ddot
    - scipy.linalg.blas.daxpy
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.blas.dasum
    functionSourceFile: scipy
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: b.copy
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    functionSourceFile: ''
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.blas.ddot
    functionSourceFile: scipy
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: z.copy
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    functionSourceFile: ''
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.blas.daxpy
    functionSourceFile: scipy
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - A
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 88
    functionName: networkx.linalg.algebraicconnectivity._LUSolver.__init__
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 5
    functionsReached:
    - scipy.sparse.linalg.splu
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.splu
    functionSourceFile: scipy
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cfeb0>
    argNames:
    - self
    - B
    - tol
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 98
    functionName: networkx.linalg.algebraicconnectivity._LUSolver.solve
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 5
    functionsReached:
    - <builtin>.range
    - numpy.ndarray
    - numpy.asarray
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 108
    functionName: networkx.linalg.algebraicconnectivity._preprocess_graph
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 3
    functionsReached:
    - attr.copy
    - <builtin>.sum
    - newdict.update
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.hasattr
    - e.get
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1588
    functionName: networkx.classes.graph.Graph.is_directed
    functionSourceFile: ''
    functionUses: 374
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1261
    functionName: networkx.classes.digraph.DiGraph.is_directed
    functionSourceFile: ''
    functionUses: 419
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1383
    functionName: networkx.algorithms.planarity.PlanarEmbedding.is_directed
    functionSourceFile: ''
    functionUses: 419
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.get
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodelist
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 134
    functionName: networkx.linalg.algebraicconnectivity._rcm_estimate
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 3
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - collections.deque.extend
    - numpy.ndarray
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - operator.itemgetter
    - <builtin>.set
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - spl.values
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - G.__class__
    - newdict.update
    - G.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - visited.update
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.reversed
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - N.graph.update
    - collections.deque
    - networkx.freeze
    - spl.items
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1794
    functionName: networkx.classes.graph.Graph.subgraph
    functionSourceFile: networkx.classes.graph
    functionUses: 214
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.hasattr
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.freeze
    - networkx.classes.filters.show_nodes.__init__
    - G.__class__
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.graph.Graph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 288
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 215
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - newdict.update
    - keydict.get
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - d.items
    - attr.pop
    - networkx.empty_graph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 5
    argDefaultValues: []
    argNames:
    - L
    - X
    - normalized
    - tol
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 149
    functionName: networkx.linalg.algebraicconnectivity._tracemin_fiedler
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 4
    functionsReached:
    - numpy.sqrt
    - scipy.linalg.blas.ddot
    - <builtin>.abs
    - networkx.linalg.algebraicconnectivity._PCGSolver.solve
    - scipy.linalg.eigh
    - networkx.linalg.algebraicconnectivity._LUSolver.solve
    - scipy.linalg.blas.dasum
    - L.diagonal
    - scipy.sparse.csc_array
    - networkx.linalg.algebraicconnectivity._PCGSolver.__init__
    - scipy.linalg.blas.daxpy
    - numpy.ndarray
    - networkx.linalg.algebraicconnectivity._PCGSolver._solve
    - numpy.asarray
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.project
    - networkx.linalg.algebraicconnectivity._LUSolver.__init__
    - scipy.linalg.inv
    - numpy.linalg.norm
    - scipy.sparse.dia_array
    - b.copy
    - <builtin>.range
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - z.copy
    - scipy.sparse.linalg.splu
    - numpy.linalg.qr
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: L.diagonal
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - X
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 206
    functionName: networkx.linalg.algebraicconnectivity._tracemin_fiedler.project
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 5
    functionsReached:
    - <builtin>.range
    - numpy.asarray
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.csc_array
    functionSourceFile: scipy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.qr
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.eigh
    functionSourceFile: scipy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.inv
    functionSourceFile: scipy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - method
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 256
    functionName: networkx.linalg.algebraicconnectivity._get_fiedler_func
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 5
    argDefaultValues: []
    argNames:
    - L
    - x
    - normalized
    - tol
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 272
    functionName: networkx.linalg.algebraicconnectivity._get_fiedler_func.find_fiedler
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 3
    functionsReached:
    - numpy.ones
    - numpy.sqrt
    - scipy.linalg.blas.ddot
    - <builtin>.abs
    - networkx.linalg.algebraicconnectivity._PCGSolver.solve
    - scipy.linalg.eigh
    - networkx.linalg.algebraicconnectivity._LUSolver.solve
    - scipy.linalg.blas.dasum
    - scipy.sparse.linalg.lobpcg
    - L.diagonal
    - scipy.sparse.csc_array
    - networkx.linalg.algebraicconnectivity._PCGSolver.__init__
    - scipy.linalg.blas.daxpy
    - numpy.ndarray
    - networkx.linalg.algebraicconnectivity._PCGSolver._solve
    - numpy.asarray
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.project
    - seed.normal
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler
    - networkx.linalg.algebraicconnectivity._LUSolver.__init__
    - numpy.linalg.norm
    - scipy.linalg.inv
    - scipy.sparse.dia_array
    - <builtin>.range
    - b.copy
    - D.diagonal
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - numpy.atleast_2d
    - z.copy
    - <builtin>.min
    - scipy.sparse.linalg.eigsh
    - scipy.sparse.linalg.splu
    - numpy.linalg.qr
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.normal
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.atleast_2d
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: D.diagonal
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.lobpcg
    functionSourceFile: scipy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8430>
    - <ast.Constant object at 0x7f734aaa8310>
    - <ast.Constant object at 0x7f734aaa8b20>
    - <ast.Constant object at 0x7f734aaa8640>
    - <ast.Constant object at 0x7f734aaa8b50>
    argNames:
    - G
    - weight
    - normalized
    - tol
    - method
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 310
    functionName: networkx.linalg.algebraicconnectivity.algebraic_connectivity
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.linalg.algebraicconnectivity._get_fiedler_func
    - networkx.linalg.algebraicconnectivity._PCGSolver.solve
    - scipy.linalg.eigh
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.linalg.algebraicconnectivity._LUSolver.solve
    - <builtin>.max
    - scipy.sparse.linalg.lobpcg
    - networkx.convert.from_dict_of_lists
    - collections.deque.extend
    - networkx.linalg.algebraicconnectivity._PCGSolver.__init__
    - numpy.ndarray
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - attr_dict.update
    - attr.pop
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.float
    - networkx.linalg.algebraicconnectivity._LUSolver.__init__
    - scipy.linalg.inv
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - numpy.ones
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - numpy.sqrt
    - attr.copy
    - keydict.get
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - keylist.append
    - <builtin>.abs
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.laplacian_matrix
    - networkx.classes.graph.Graph.is_directed
    - operator.itemgetter
    - <builtin>.set
    - G.degree
    - networkx.linalg.algebraicconnectivity._PCGSolver._solve
    - <builtin>.hasattr
    - numpy.asarray
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.linalg.algebraicconnectivity._preprocess_graph
    - spl.values
    - networkx.utils.misc.arbitrary_element
    - b.copy
    - networkx.utils.arbitrary_element
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - networkx.classes.graph.Graph.subgraph
    - numpy.atleast_2d
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - scipy.sparse.linalg.eigsh
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - numpy.linalg.qr
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - G.__class__
    - <builtin>.sum
    - newdict.update
    - scipy.linalg.blas.ddot
    - G.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - <builtin>.len
    - L.diagonal
    - scipy.sparse.csc_array
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - scipy.linalg.blas.daxpy
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.project
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - numpy.linalg.norm
    - scipy.sparse.dia_array
    - <builtin>.range
    - D.diagonal
    - z.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - datadict.items
    - networkx.empty_graph
    - scipy.sparse.linalg.splu
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - visited.update
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.linalg.algebraicconnectivity._rcm_estimate
    - <builtin>.reversed
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - scipy.linalg.blas.dasum
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - e.get
    - <builtin>.list
    - seed.normal
    - d.items
    - N.graph.update
    - collections.deque
    - networkx.freeze
    - networkx.linalg.algebraicconnectivity._get_fiedler_func.find_fiedler
    - spl.items
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_connected
    functionSourceFile: ''
    functionUses: 247
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.laplacian_matrix
    functionSourceFile: ''
    functionUses: 18
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd27b80>
    - <ast.Constant object at 0x7f734cd27430>
    - <ast.Constant object at 0x7f734cd27a30>
    - <ast.Constant object at 0x7f734cd270a0>
    - <ast.Constant object at 0x7f734cd27790>
    argNames:
    - G
    - weight
    - normalized
    - tol
    - method
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 406
    functionName: networkx.linalg.algebraicconnectivity.fiedler_vector
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.linalg.algebraicconnectivity._get_fiedler_func
    - networkx.linalg.algebraicconnectivity._PCGSolver.solve
    - scipy.linalg.eigh
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.linalg.algebraicconnectivity._LUSolver.solve
    - <builtin>.max
    - scipy.sparse.linalg.lobpcg
    - networkx.convert.from_dict_of_lists
    - collections.deque.extend
    - networkx.linalg.algebraicconnectivity._PCGSolver.__init__
    - numpy.ndarray
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - attr_dict.update
    - attr.pop
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.linalg.algebraicconnectivity._LUSolver.__init__
    - scipy.linalg.inv
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - numpy.ones
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - numpy.sqrt
    - attr.copy
    - keydict.get
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - keylist.append
    - <builtin>.abs
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.laplacian_matrix
    - networkx.classes.graph.Graph.is_directed
    - operator.itemgetter
    - <builtin>.set
    - G.degree
    - networkx.linalg.algebraicconnectivity._PCGSolver._solve
    - <builtin>.hasattr
    - numpy.asarray
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.linalg.algebraicconnectivity._preprocess_graph
    - spl.values
    - networkx.utils.misc.arbitrary_element
    - b.copy
    - networkx.utils.arbitrary_element
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - networkx.classes.graph.Graph.subgraph
    - numpy.atleast_2d
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - scipy.sparse.linalg.eigsh
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - numpy.linalg.qr
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - G.__class__
    - <builtin>.sum
    - newdict.update
    - scipy.linalg.blas.ddot
    - G.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - numpy.array
    - networkx.is_connected
    - <builtin>.len
    - L.diagonal
    - scipy.sparse.csc_array
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - scipy.linalg.blas.daxpy
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.project
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - numpy.linalg.norm
    - scipy.sparse.dia_array
    - <builtin>.range
    - D.diagonal
    - z.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - datadict.items
    - networkx.empty_graph
    - scipy.sparse.linalg.splu
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - visited.update
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.linalg.algebraicconnectivity._rcm_estimate
    - <builtin>.reversed
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - scipy.linalg.blas.dasum
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - e.get
    - <builtin>.list
    - seed.normal
    - d.items
    - N.graph.update
    - collections.deque
    - networkx.freeze
    - networkx.linalg.algebraicconnectivity._get_fiedler_func.find_fiedler
    - spl.items
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6ef10>
    - <ast.Constant object at 0x7f734cc6e430>
    - <ast.Constant object at 0x7f734cc6e040>
    - <ast.Constant object at 0x7f734cc6e070>
    - <ast.Constant object at 0x7f734cc6ed90>
    argNames:
    - G
    - weight
    - normalized
    - tol
    - method
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 503
    functionName: networkx.linalg.algebraicconnectivity.spectral_ordering
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.linalg.algebraicconnectivity._get_fiedler_func
    - networkx.linalg.algebraicconnectivity._PCGSolver.solve
    - scipy.linalg.eigh
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.linalg.algebraicconnectivity._LUSolver.solve
    - <builtin>.max
    - scipy.sparse.linalg.lobpcg
    - networkx.convert.from_dict_of_lists
    - collections.deque.extend
    - networkx.linalg.algebraicconnectivity._PCGSolver.__init__
    - numpy.ndarray
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - attr_dict.update
    - attr.pop
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.linalg.algebraicconnectivity._LUSolver.__init__
    - scipy.linalg.inv
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - numpy.ones
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - numpy.sqrt
    - attr.copy
    - keydict.get
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - keylist.append
    - <builtin>.abs
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.laplacian_matrix
    - networkx.classes.graph.Graph.is_directed
    - operator.itemgetter
    - <builtin>.set
    - order.extend
    - networkx.linalg.algebraicconnectivity._PCGSolver._solve
    - <builtin>.hasattr
    - numpy.asarray
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.linalg.algebraicconnectivity._preprocess_graph
    - spl.values
    - networkx.utils.misc.arbitrary_element
    - b.copy
    - networkx.utils.arbitrary_element
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda2>
    - networkx.classes.graph.Graph.subgraph
    - numpy.atleast_2d
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - scipy.sparse.linalg.eigsh
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - numpy.linalg.qr
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.utils.rcm.pseudo_peripheral_node
    - G.__class__
    - <builtin>.sum
    - newdict.update
    - scipy.linalg.blas.ddot
    - G.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - L.diagonal
    - scipy.sparse.csc_array
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - scipy.linalg.blas.daxpy
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.project
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - numpy.linalg.norm
    - scipy.sparse.dia_array
    - <builtin>.range
    - D.diagonal
    - z.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - scipy.sparse.linalg.splu
    - networkx.linalg.algebraicconnectivity._tracemin_fiedler.<lambda1>
    - numpy.zeros
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - visited.update
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.linalg.algebraicconnectivity._rcm_estimate
    - <builtin>.reversed
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - scipy.linalg.blas.dasum
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - e.get
    - <builtin>.list
    - seed.normal
    - d.items
    - N.graph.update
    - collections.deque
    - networkx.freeze
    - networkx.linalg.algebraicconnectivity._get_fiedler_func.find_fiedler
    - spl.items
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: order.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65edf0>
    - <ast.Constant object at 0x7f734a65e0d0>
    - <ast.Constant object at 0x7f734a65e280>
    - <ast.Constant object at 0x7f734a65e5e0>
    - <ast.Constant object at 0x7f734a65e6a0>
    argNames:
    - G
    - weight
    - normalized
    - tol
    - method
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 586
    functionName: networkx.linalg.algebraicconnectivity.spectral_bisection
    functionSourceFile: networkx.linalg.algebraicconnectivity
    functionUses: 0
    functionsReached:
    - networkx.fiedler_vector
    - numpy.array
    - <builtin>.set
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.fiedler_vector
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.linalg.bethehessianmatrix
    functionSourceFile: networkx.linalg.bethehessianmatrix
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.degree
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.eye_array
    functionSourceFile: scipy
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.linalg.modularitymatrix
    functionSourceFile: networkx.linalg.modularitymatrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9de20>
    - <ast.Constant object at 0x7f734cf9d3d0>
    argNames:
    - G
    - nodelist
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 12
    functionName: networkx.linalg.modularitymatrix.modularity_matrix
    functionSourceFile: networkx.linalg.modularitymatrix
    functionUses: 0
    functionsReached:
    - numpy.outer
    - <builtin>.list
    - A.sum
    - networkx.to_scipy_sparse_array
    - k.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.outer
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e7370>
    - <ast.Constant object at 0x7f734b6e7c70>
    argNames:
    - G
    - nodelist
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 81
    functionName: networkx.linalg.modularitymatrix.directed_modularity_matrix
    functionSourceFile: networkx.linalg.modularitymatrix
    functionUses: 0
    functionsReached:
    - numpy.outer
    - k_in.sum
    - <builtin>.list
    - A.sum
    - networkx.to_scipy_sparse_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k_in.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.linalg.laplacianmatrix
    functionSourceFile: networkx.linalg.laplacianmatrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8c40>
    - <ast.Constant object at 0x7f734b6a8a60>
    argNames:
    - G
    - nodelist
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 23
    functionName: networkx.linalg.laplacianmatrix.laplacian_matrix
    functionSourceFile: networkx.linalg.laplacianmatrix
    functionUses: 0
    functionsReached:
    - A.sum
    - scipy.sparse.dia_array
    - networkx.to_scipy_sparse_array
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0f5e0>
    - <ast.Constant object at 0x7f734cd0feb0>
    argNames:
    - G
    - nodelist
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 133
    functionName: networkx.linalg.laplacianmatrix.normalized_laplacian_matrix
    functionSourceFile: networkx.linalg.laplacianmatrix
    functionUses: 0
    functionsReached:
    - scipy.sparse.dia_array
    - numpy.errstate
    - numpy.isinf
    - numpy.sqrt
    - <builtin>.list
    - A.sum
    - networkx.to_scipy_sparse_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.isinf
    functionSourceFile: numpy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cce8340>
    - <ast.Constant object at 0x7f734cce8670>
    - <ast.Constant object at 0x7f734cce8e80>
    - <ast.Constant object at 0x7f734cce8b80>
    argNames:
    - G
    - nodelist
    - weight
    - walk_type
    - alpha
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 253
    functionName: networkx.linalg.laplacianmatrix.directed_laplacian_matrix
    functionSourceFile: networkx.linalg.laplacianmatrix
    functionUses: 0
    functionsReached:
    - scipy.sparse.dia_array
    - evecs.flatten
    - numpy.abs
    - networkx.linalg.laplacianmatrix._transition_matrix
    - scipy.sparse.linalg.eigs
    - v.sum
    - numpy.sqrt
    - A.sum
    - <builtin>.len
    - networkx.is_aperiodic
    - networkx.to_scipy_sparse_array
    - networkx.is_strongly_connected
    - A.toarray
    - numpy.identity
    - scipy.sparse.eye_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe83d0>
    - <ast.Constant object at 0x7f734cbe8a90>
    - <ast.Constant object at 0x7f734cbe8730>
    - <ast.Constant object at 0x7f734cbe8a30>
    argNames:
    - G
    - nodelist
    - weight
    - walk_type
    - alpha
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 436
    functionName: networkx.linalg.laplacianmatrix._transition_matrix
    functionSourceFile: networkx.linalg.laplacianmatrix
    functionUses: 2
    functionsReached:
    - scipy.sparse.dia_array
    - networkx.is_strongly_connected
    - A.sum
    - networkx.to_scipy_sparse_array
    - A.toarray
    - networkx.is_aperiodic
    - scipy.sparse.eye_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.eigs
    functionSourceFile: scipy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: evecs.flatten
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v.sum
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e640>
    - <ast.Constant object at 0x7f734a5bb0a0>
    - <ast.Constant object at 0x7f734a5bb6a0>
    - <ast.Constant object at 0x7f734a5bbac0>
    argNames:
    - G
    - nodelist
    - weight
    - walk_type
    - alpha
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 351
    functionName: networkx.linalg.laplacianmatrix.directed_combinatorial_laplacian_matrix
    functionSourceFile: networkx.linalg.laplacianmatrix
    functionUses: 0
    functionsReached:
    - scipy.sparse.dia_array
    - evecs.flatten
    - networkx.linalg.laplacianmatrix._transition_matrix
    - scipy.sparse.linalg.eigs
    - v.sum
    - networkx.is_strongly_connected
    - A.sum
    - networkx.to_scipy_sparse_array
    - A.toarray
    - networkx.is_aperiodic
    - scipy.sparse.eye_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_strongly_connected
    functionSourceFile: ''
    functionUses: 206
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_aperiodic
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.toarray
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.linalg.attrmatrix
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - node_attr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 10
    functionName: networkx.linalg.attrmatrix._node_value
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 2
    functionsReached:
    - <builtin>.callable
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - u
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 41
    functionName: networkx.linalg.attrmatrix._node_value.value
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - edge_attr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 55
    functionName: networkx.linalg.attrmatrix._edge_value
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 2
    functionsReached:
    - <builtin>.callable
    - G.is_multigraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 123
    functionName: networkx.linalg.attrmatrix._edge_value.value
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - d.get
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.get
    functionSourceFile: <builtin>
    functionUses: 245
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 2
    IfCount: 6
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb60a0>
    - <ast.Constant object at 0x7f734cbb6f70>
    - <ast.Constant object at 0x7f734cbb6370>
    - <ast.Constant object at 0x7f734cbb65b0>
    - <ast.Constant object at 0x7f734cbb62b0>
    - <ast.Constant object at 0x7f734cbb6f10>
    argNames:
    - G
    - edge_attr
    - node_attr
    - normalized
    - rc_order
    - dtype
    - order
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 147
    functionName: networkx.linalg.attrmatrix.attr_matrix
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 0
    functionsReached:
    - G.is_directed
    - <builtin>.range
    - networkx.linalg.attrmatrix._node_value
    - M.sum
    - <builtin>.zip
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.callable
    - G.is_multigraph
    - networkx.linalg.attrmatrix._edge_value
    - G.adjacency
    - seen.add
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.adjacency
    functionSourceFile: <builtin>
    functionUses: 217
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: M.sum
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 2
    IfCount: 6
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a82b0>
    - <ast.Constant object at 0x7f734b6a86a0>
    - <ast.Constant object at 0x7f734b6a8730>
    - <ast.Constant object at 0x7f734b6a8610>
    - <ast.Constant object at 0x7f734b6a8d60>
    argNames:
    - G
    - edge_attr
    - node_attr
    - normalized
    - rc_order
    - dtype
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 312
    functionName: networkx.linalg.attrmatrix.attr_sparse_matrix
    functionSourceFile: networkx.linalg.attrmatrix
    functionUses: 0
    functionsReached:
    - G.is_directed
    - <builtin>.range
    - networkx.linalg.attrmatrix._node_value
    - M.sum
    - <builtin>.zip
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.callable
    - G.is_multigraph
    - networkx.linalg.attrmatrix._edge_value
    - scipy.sparse.lil_array
    - G.adjacency
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.linalg.spectrum
    functionSourceFile: networkx.linalg.spectrum
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc90f70>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 17
    functionName: networkx.linalg.spectrum.laplacian_spectrum
    functionSourceFile: networkx.linalg.spectrum
    functionUses: 0
    functionsReached:
    - networkx.laplacian_matrix
    - scipy.linalg.eigvalsh
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.eigvalsh
    functionSourceFile: scipy
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d6112e0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 61
    functionName: networkx.linalg.spectrum.normalized_laplacian_spectrum
    functionSourceFile: networkx.linalg.spectrum
    functionUses: 0
    functionsReached:
    - networkx.normalized_laplacian_matrix
    - scipy.linalg.eigvalsh
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.normalized_laplacian_matrix
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d611b80>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 95
    functionName: networkx.linalg.spectrum.adjacency_spectrum
    functionSourceFile: networkx.linalg.spectrum
    functionUses: 0
    functionsReached:
    - networkx.adjacency_matrix
    - scipy.linalg.eigvals
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.adjacency_matrix
    functionSourceFile: ''
    functionUses: 208
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.eigvals
    functionSourceFile: scipy
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.directed_modularity_matrix
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.modularity_matrix
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bethe_hessian_matrix
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.readwrite
    functionSourceFile: networkx.readwrite
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.sparse6
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 17
    IfCount: 5
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 23
    functionName: networkx.readwrite.sparse6._generate_sparse6_bytes
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 2
    functionsReached:
    - <builtin>.range
    - <builtin>.sorted
    - networkx.readwrite.sparse6._generate_sparse6_bytes.enc
    - <builtin>.max
    - <builtin>.min
    - <builtin>.len
    - bits.append
    - networkx.readwrite.graph6.n_to_data
    - bits.extend
    - str.encode
    - G.edges
    - <builtin>.chr
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 407
    functionName: networkx.readwrite.graph6.n_to_data
    functionSourceFile: ''
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.chr
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: str.encode
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 59
    functionName: networkx.readwrite.sparse6._generate_sparse6_bytes.enc
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 3
    functionsReached:
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bits.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bits.extend
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 3
    IfCount: 7
    argCount: 1
    argDefaultValues: []
    argNames:
    - string
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 106
    functionName: networkx.readwrite.sparse6.from_sparse6_bytes
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 1
    functionsReached:
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.readwrite.sparse6.from_sparse6_bytes.parseData
    - networkx.readwrite.graph6.data_to_n
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.iter
    - string.startswith
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: string.startswith
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - data
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 387
    functionName: networkx.readwrite.graph6.data_to_n
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 150
    functionName: networkx.readwrite.sparse6.from_sparse6_bytes.parseData
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 2
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1303
    functionName: networkx.classes.graph.Graph.has_edge
    functionSourceFile: ''
    functionUses: 248
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9c4c0>
    argNames:
    - self
    - u
    - v
    - key
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 773
    functionName: networkx.classes.multigraph.MultiGraph.has_edge
    functionSourceFile: ''
    functionUses: 252
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfea30>
    - <ast.Constant object at 0x7f734cbfeaf0>
    argNames:
    - G
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 203
    functionName: networkx.readwrite.sparse6.to_sparse6_bytes
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.readwrite.sparse6._generate_sparse6_bytes.enc
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - networkx.readwrite.graph6.n_to_data
    - bits.extend
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - str.encode
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - <builtin>.chr
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.readwrite.sparse6._generate_sparse6_bytes
    - networkx.convert_node_labels_to_integers
    - G.__class__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - G.edges
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - bits.append
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.graph.Graph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.convert_node_labels_to_integers
    functionSourceFile: ''
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 255
    functionName: networkx.readwrite.sparse6.read_sparse6
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 0
    functionsReached:
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - line.strip
    - glist.append
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.next
    - networkx.readwrite.sparse6.from_sparse6_bytes.parseData
    - networkx.classes.graph.Graph.has_edge
    - networkx.readwrite.graph6.data_to_n
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.iter
    - string.startswith
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.readwrite.sparse6.from_sparse6_bytes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.strip
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: glist.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba640>
    - <ast.Constant object at 0x7f734cbba0d0>
    argNames:
    - G
    - path
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 320
    functionName: networkx.readwrite.sparse6.write_sparse6
    functionSourceFile: networkx.readwrite.sparse6
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - path.write
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.readwrite.sparse6._generate_sparse6_bytes.enc
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - networkx.readwrite.graph6.n_to_data
    - bits.extend
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - str.encode
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - <builtin>.chr
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.readwrite.sparse6._generate_sparse6_bytes
    - networkx.convert_node_labels_to_integers
    - G.__class__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - G.edges
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - bits.append
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.graph.Graph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.exception
    functionSourceFile: networkx.exception
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - num_iterations
    - args
    - kw
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 127
    functionName: networkx.exception.PowerIterationFailedConvergence.__init__
    functionSourceFile: networkx.exception
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.graph6
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 23
    functionName: networkx.readwrite.graph6._generate_graph6_bytes
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 3
    functionsReached:
    - <builtin>.range
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - networkx.readwrite.graph6.n_to_data
    - <builtin>.enumerate
    - itertools.islice
    - str.encode
    - <builtin>.chr
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - bytes_in
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 65
    functionName: networkx.readwrite.graph6.from_graph6_bytes
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 1
    functionsReached:
    - networkx.readwrite.graph6.from_graph6_bytes.bits
    - <builtin>.zip
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.readwrite.graph6.data_to_n
    - bytes_in.startswith
    - <builtin>.iter
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - bytes_in.rstrip
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 108
    functionName: networkx.readwrite.graph6.from_graph6_bytes.bits
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bytes_in.rstrip
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bytes_in.startswith
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66ec70>
    - <ast.Constant object at 0x7f734b66e940>
    argNames:
    - G
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 143
    functionName: networkx.readwrite.graph6.to_graph6_bytes
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - <builtin>.sorted
    - networkx.convert_node_labels_to_integers
    - G.subgraph
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - networkx.readwrite.graph6._generate_graph6_bytes
    - networkx.classes.graph.Graph.nodes
    - networkx.readwrite.graph6.n_to_data
    - networkx.classes.reportviews.NodeView.__init__
    - <builtin>.enumerate
    - itertools.islice
    - str.encode
    - <builtin>.chr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 197
    functionName: networkx.readwrite.graph6.read_graph6
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 0
    functionsReached:
    - networkx.readwrite.graph6.from_graph6_bytes.bits
    - <builtin>.zip
    - attr.copy
    - networkx.readwrite.graph6.from_graph6_bytes
    - keydict.get
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - line.strip
    - glist.append
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.readwrite.graph6.data_to_n
    - bytes_in.startswith
    - <builtin>.iter
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - bytes_in.rstrip
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6e160>
    - <ast.Constant object at 0x7f734cc6e700>
    argNames:
    - G
    - path
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 263
    functionName: networkx.readwrite.graph6.write_graph6
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - <builtin>.sorted
    - networkx.convert_node_labels_to_integers
    - G.subgraph
    - f.write
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - networkx.readwrite.graph6._generate_graph6_bytes
    - networkx.classes.graph.Graph.nodes
    - networkx.readwrite.graph6.n_to_data
    - networkx.classes.reportviews.NodeView.__init__
    - <builtin>.enumerate
    - itertools.islice
    - networkx.readwrite.graph6.write_graph6_file
    - str.encode
    - <builtin>.chr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6ee80>
    - <ast.Constant object at 0x7f734cc6e3d0>
    argNames:
    - G
    - f
    - nodes
    - header
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 324
    functionName: networkx.readwrite.graph6.write_graph6_file
    functionSourceFile: networkx.readwrite.graph6
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.sorted
    - networkx.convert_node_labels_to_integers
    - G.subgraph
    - f.write
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - networkx.readwrite.graph6._generate_graph6_bytes
    - networkx.classes.graph.Graph.nodes
    - networkx.readwrite.graph6.n_to_data
    - networkx.classes.reportviews.NodeView.__init__
    - <builtin>.enumerate
    - itertools.islice
    - str.encode
    - <builtin>.chr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: f.write
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.adjlist
    functionSourceFile: networkx.readwrite.adjlist
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0fe50>
    argNames:
    - G
    - delimiter
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 31
    functionName: networkx.readwrite.adjlist.generate_adjlist
    functionSourceFile: networkx.readwrite.adjlist
    functionUses: 1
    functionsReached:
    - G.is_directed
    - delimiter.join
    - nodes.append
    - nbrs.items
    - <builtin>.len
    - nodes.extend
    - <builtin>.set
    - G.is_multigraph
    - <builtin>.str
    - G.adjacency
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrs.items
    functionSourceFile: <builtin>
    functionUses: 373
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes.append
    functionSourceFile: <builtin>
    functionUses: 203
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: delimiter.join
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06340>
    - <ast.Constant object at 0x7f734bc06790>
    - <ast.Constant object at 0x7f734bc06550>
    argNames:
    - G
    - path
    - comments
    - delimiter
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 110
    functionName: networkx.readwrite.adjlist.write_adjlist
    functionSourceFile: networkx.readwrite.adjlist
    functionUses: 0
    functionsReached:
    - G.is_directed
    - time.asctime
    - delimiter.join
    - line.encode
    - nodes.append
    - path.write
    - nbrs.items
    - <builtin>.len
    - nodes.extend
    - <builtin>.set
    - G.is_multigraph
    - time.gmtime
    - <builtin>.str
    - header.encode
    - G.adjacency
    - seen.add
    - networkx.readwrite.adjlist.generate_adjlist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: time.gmtime
    functionSourceFile: time
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: time.asctime
    functionSourceFile: time
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: header.encode
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.encode
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734ceff730>
    - <ast.Constant object at 0x7f734ceffc10>
    - <ast.Constant object at 0x7f734ceff5b0>
    - <ast.Constant object at 0x7f734ceff370>
    argNames:
    - lines
    - comments
    - delimiter
    - create_using
    - nodetype
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 174
    functionName: networkx.readwrite.adjlist.parse_adjlist
    functionSourceFile: networkx.readwrite.adjlist
    functionUses: 1
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - vlist.pop
    - keylist.append
    - <builtin>.map
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - attr_dict.update
    - <builtin>.list
    - line.rstrip
    - line.find
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.find
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.rstrip
    functionSourceFile: <builtin>
    functionUses: 20
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vlist.pop
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 6
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - ebunch_to_add
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 538
    functionName: networkx.classes.multigraph.MultiGraph.add_edges_from
    functionSourceFile: networkx.classes.multigraph
    functionUses: 372
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e3a0>
    - <ast.Constant object at 0x7f734c43ed00>
    - <ast.Constant object at 0x7f734c43e160>
    - <ast.Constant object at 0x7f734c43e880>
    - <ast.Constant object at 0x7f734c43e220>
    argNames:
    - path
    - comments
    - delimiter
    - create_using
    - nodetype
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 248
    functionName: networkx.readwrite.adjlist.read_adjlist
    functionSourceFile: networkx.readwrite.adjlist
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - vlist.pop
    - keylist.append
    - <builtin>.map
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - attr_dict.update
    - networkx.readwrite.adjlist.parse_adjlist
    - line.decode
    - <builtin>.list
    - line.rstrip
    - line.find
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.decode
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.readwrite.json_graph
    functionSourceFile: networkx.readwrite.json_graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.json_graph.adjacency
    functionSourceFile: networkx.readwrite.json_graph.adjacency
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Name object at 0x7f734cadbe80>
    argNames:
    - G
    - attrs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 8
    functionName: networkx.readwrite.json_graph.adjacency.adjacency_data
    functionSourceFile: networkx.readwrite.json_graph.adjacency
    functionUses: 0
    functionsReached:
    - G.is_directed
    - keys.items
    - G.graph.items
    - <builtin>.list
    - adj.append
    - G.is_multigraph
    - nbrdict.items
    - G.adjacency
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.graph.items
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrdict.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: keys.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: adj.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 8
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc841f0>
    - <ast.Constant object at 0x7f734cc84640>
    - <ast.Name object at 0x7f734a4d8df0>
    argNames:
    - data
    - directed
    - multigraph
    - attrs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 85
    functionName: networkx.readwrite.json_graph.adjacency.adjacency_graph
    functionSourceFile: networkx.readwrite.json_graph.adjacency
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - tdata.copy
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - mapping.append
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - node_data.pop
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.empty_graph
    - target_data.pop
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - data.get
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - d.copy
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data.get
    functionSourceFile: <builtin>
    functionUses: 67
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26850>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 1124
    functionName: networkx.classes.multigraph.MultiGraph.to_directed
    functionSourceFile: networkx.classes.multigraph
    functionUses: 14
    functionsReached:
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - d.items
    - attr.pop
    - networkx.empty_graph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - datadict.items
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e3a0>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1681
    functionName: networkx.classes.graph.Graph.to_directed
    functionSourceFile: networkx.classes.graph
    functionUses: 14
    functionsReached:
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - datadict.items
    - <builtin>.iter
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - collections.abc.Mapping.items
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.copy
    functionSourceFile: <builtin>
    functionUses: 223
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_data.pop
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tdata.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: target_data.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.json_graph.tree
    functionSourceFile: networkx.readwrite.json_graph.tree
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8280>
    - <ast.Constant object at 0x7f734aaa89d0>
    argNames:
    - G
    - root
    - ident
    - children
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 8
    functionName: networkx.readwrite.json_graph.tree.tree_data
    functionSourceFile: networkx.readwrite.json_graph.tree
    functionUses: 0
    functionsReached:
    - G.is_directed
    - G.number_of_nodes
    - G.number_of_edges
    - networkx.is_weakly_connected
    - <builtin>.len
    - networkx.readwrite.json_graph.tree.tree_data.add_children
    - children_.append
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.number_of_nodes
    functionSourceFile: <builtin>
    functionUses: 228
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 222
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_weakly_connected
    functionSourceFile: ''
    functionUses: 207
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 70
    functionName: networkx.readwrite.json_graph.tree.tree_data.add_children
    functionSourceFile: networkx.readwrite.json_graph.tree
    functionUses: 1
    functionsReached:
    - <builtin>.len
    - children_.append
    - networkx.readwrite.json_graph.tree.tree_data.add_children
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: children_.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccffb50>
    - <ast.Constant object at 0x7f734ccff0d0>
    argNames:
    - data
    - ident
    - children
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 87
    functionName: networkx.readwrite.json_graph.tree.tree_graph
    functionSourceFile: networkx.readwrite.json_graph.tree
    functionUses: 0
    functionsReached:
    - attr_dict.update
    - networkx.readwrite.json_graph.tree.tree_graph.add_children
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - data.get
    - data.items
    - <builtin>.len
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - parent
    - children_
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 120
    functionName: networkx.readwrite.json_graph.tree.tree_graph.add_children
    functionSourceFile: networkx.readwrite.json_graph.tree
    functionUses: 1
    functionsReached:
    - attr_dict.update
    - networkx.readwrite.json_graph.tree.tree_graph.add_children
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - data.get
    - data.items
    - <builtin>.len
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data.items
    functionSourceFile: <builtin>
    functionUses: 29
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.json_graph.node_link
    functionSourceFile: networkx.readwrite.json_graph.node_link
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.readwrite.json_graph.node_link._to_tuple
    functionSourceFile: networkx.readwrite.json_graph.node_link
    functionUses: 1
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.tuple
    - <builtin>.map
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 7
    argDefaultValues: []
    argNames:
    - G
    - source
    - target
    - name
    - key
    - edges
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 26
    functionName: networkx.readwrite.json_graph.node_link.node_link_data
    functionSourceFile: networkx.readwrite.json_graph.node_link
    functionUses: 0
    functionsReached:
    - G.is_directed
    - <builtin>.len
    - G.is_multigraph
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 9
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc1cdc0>
    - <ast.Constant object at 0x7f734cc1cfd0>
    argNames:
    - data
    - directed
    - multigraph
    - source
    - target
    - name
    - key
    - edges
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 144
    functionName: networkx.readwrite.json_graph.node_link.node_link_graph
    functionSourceFile: networkx.readwrite.json_graph.node_link
    functionUses: 0
    functionsReached:
    - networkx.readwrite.json_graph.node_link._to_tuple
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.tuple
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.map
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - data.get
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - itertools.count
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.json_graph.cytoscape
    functionSourceFile: networkx.readwrite.json_graph.cytoscape
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7e850>
    - <ast.Constant object at 0x7f734bb7ee20>
    argNames:
    - G
    - name
    - ident
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 6
    functionName: networkx.readwrite.json_graph.cytoscape.cytoscape_data
    functionSourceFile: networkx.readwrite.json_graph.cytoscape
    functionUses: 0
    functionsReached:
    - G.is_directed
    - nodes.append
    - edges.append
    - <builtin>.list
    - G.graph.items
    - G.is_multigraph
    - <builtin>.str
    - G.nodes.items
    - j.copy
    - j.get
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.nodes.items
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: j.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: j.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.append
    functionSourceFile: <builtin>
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 7
    IfCount: 6
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66ea30>
    - <ast.Constant object at 0x7f734b66e670>
    argNames:
    - data
    - name
    - ident
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 96
    functionName: networkx.readwrite.json_graph.cytoscape.cytoscape_graph
    functionSourceFile: networkx.readwrite.json_graph.cytoscape
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - nbrs.items
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - attr.copy
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - keydict.items
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - data.get
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - G.add_nodes_from
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - networkx.classes.reportviews.NodeView.__iter__
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - datadict.items
    - <builtin>.iter
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.empty_graph
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.gml
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - text
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 46
    functionName: networkx.readwrite.gml.escape
    functionSourceFile: networkx.readwrite.gml
    functionUses: 3
    functionsReached:
    - <builtin>.isinstance
    - re.sub
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - m
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 53
    functionName: networkx.readwrite.gml.escape.fixup
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - m.group
    - <builtin>.ord
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: m.group
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.ord
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - text
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 61
    functionName: networkx.readwrite.gml.unescape
    functionSourceFile: networkx.readwrite.gml
    functionUses: 6
    functionsReached:
    - re.sub
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - m
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 64
    functionName: networkx.readwrite.gml.unescape.fixup
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - m.group
    - <builtin>.chr
    - <builtin>.int
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - rep
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 86
    functionName: networkx.readwrite.gml.literal_destringizer
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - ast.literal_eval
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ast.literal_eval
    functionSourceFile: ast
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41df0>
    - <ast.Constant object at 0x7f734cd414c0>
    argNames:
    - path
    - label
    - destringizer
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 116
    functionName: networkx.readwrite.gml.read_gml
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    - G.graph.update
    - networkx.readwrite.gml.parse_gml_lines.parse_graph
    - line.count
    - collections.defaultdict.items
    - <builtin>.str
    - <builtin>.enumerate
    - edge.pop
    - node_labels.add
    - enum.Enum.__init__
    - <builtin>.int
    - group.rstrip
    - line.strip
    - networkx.readwrite.gml.parse_gml_lines.parse_dict
    - re.compile
    - match.group
    - <builtin>.len
    - networkx.readwrite.gml.parse_gml_lines.tokenize
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.readwrite.gml.parse_gml_lines
    - <builtin>.next
    - graph.items
    - typing.NamedTuple.__init__
    - networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    - G.add_node
    - G.add_edge
    - dct.pop
    - line.decode
    - line.rstrip
    - networkx.readwrite.gml.parse_gml_lines.consume
    - <builtin>.float
    - <builtin>.isinstance
    - networkx.readwrite.gml.unescape
    - collections.defaultdict
    - <builtin>.range
    - networkx.readwrite.gml.parse_gml_lines.pop_attr
    - multilines.append
    - networkx.readwrite.gml.read_gml.filter_lines
    - networkx.readwrite.gml.parse_gml_lines.parse_kv
    - G.has_edge
    - graph.get
    - re.sub
    - <builtin>.repr
    - graph.pop
    - tokens.match
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 183
    functionName: networkx.readwrite.gml.read_gml.filter_lines
    functionSourceFile: networkx.readwrite.gml
    functionUses: 1
    functionsReached:
    - <builtin>.isinstance
    - line.decode
    - <builtin>.str
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 6
    IfCount: 10
    argCount: 3
    argDefaultValues: []
    argNames:
    - lines
    - label
    - destringizer
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 299
    functionName: networkx.readwrite.gml.parse_gml_lines
    functionSourceFile: networkx.readwrite.gml
    functionUses: 2
    functionsReached:
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    - G.graph.update
    - networkx.readwrite.gml.parse_gml_lines.parse_graph
    - line.count
    - collections.defaultdict.items
    - <builtin>.str
    - <builtin>.enumerate
    - edge.pop
    - node_labels.add
    - enum.Enum.__init__
    - <builtin>.int
    - group.rstrip
    - line.strip
    - networkx.readwrite.gml.parse_gml_lines.parse_dict
    - re.compile
    - match.group
    - <builtin>.len
    - networkx.readwrite.gml.parse_gml_lines.tokenize
    - <builtin>.set
    - networkx.relabel_nodes
    - <builtin>.next
    - graph.items
    - typing.NamedTuple.__init__
    - networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    - G.add_edge
    - G.add_node
    - dct.pop
    - line.rstrip
    - networkx.readwrite.gml.parse_gml_lines.consume
    - <builtin>.float
    - <builtin>.isinstance
    - networkx.readwrite.gml.unescape
    - collections.defaultdict
    - <builtin>.range
    - networkx.readwrite.gml.parse_gml_lines.pop_attr
    - multilines.append
    - networkx.readwrite.gml.parse_gml_lines.parse_kv
    - G.has_edge
    - graph.get
    - re.sub
    - <builtin>.repr
    - graph.pop
    - tokens.match
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3040>
    - <ast.Constant object at 0x7f734d3a31c0>
    argNames:
    - lines
    - label
    - destringizer
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 200
    functionName: networkx.readwrite.gml.parse_gml
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    - G.graph.update
    - networkx.readwrite.gml.parse_gml_lines.parse_graph
    - line.count
    - collections.defaultdict.items
    - <builtin>.str
    - <builtin>.enumerate
    - edge.pop
    - lines.splitlines
    - node_labels.add
    - enum.Enum.__init__
    - networkx.readwrite.gml.parse_gml.decode_line
    - <builtin>.int
    - group.rstrip
    - line.strip
    - networkx.readwrite.gml.parse_gml_lines.parse_dict
    - re.compile
    - match.group
    - <builtin>.len
    - networkx.readwrite.gml.parse_gml_lines.tokenize
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.readwrite.gml.parse_gml_lines
    - <builtin>.next
    - graph.items
    - typing.NamedTuple.__init__
    - networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    - G.add_node
    - G.add_edge
    - dct.pop
    - line.decode
    - line.rstrip
    - networkx.readwrite.gml.parse_gml_lines.consume
    - line.find
    - <builtin>.float
    - <builtin>.isinstance
    - networkx.readwrite.gml.unescape
    - collections.defaultdict
    - <builtin>.range
    - networkx.readwrite.gml.parse_gml_lines.pop_attr
    - multilines.append
    - networkx.readwrite.gml.parse_gml_lines.parse_kv
    - G.has_edge
    - graph.get
    - re.sub
    - <builtin>.repr
    - graph.pop
    - networkx.readwrite.gml.parse_gml.filter_lines
    - tokens.match
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - line
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 249
    functionName: networkx.readwrite.gml.parse_gml.decode_line
    functionSourceFile: networkx.readwrite.gml
    functionUses: 2
    functionsReached:
    - <builtin>.isinstance
    - line.decode
    - <builtin>.str
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 259
    functionName: networkx.readwrite.gml.parse_gml.filter_lines
    functionSourceFile: networkx.readwrite.gml
    functionUses: 1
    functionsReached:
    - networkx.readwrite.gml.parse_gml.decode_line
    - line.decode
    - line.find
    - <builtin>.str
    - <builtin>.isinstance
    - lines.splitlines
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lines.splitlines
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 3
    IfCount: 10
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 302
    functionName: networkx.readwrite.gml.parse_gml_lines.tokenize
    functionSourceFile: networkx.readwrite.gml
    functionUses: 3
    functionsReached:
    - typing.NamedTuple.__init__
    - enum.Enum.__init__
    - <builtin>.range
    - <builtin>.int
    - line.count
    - multilines.append
    - group.rstrip
    - line.strip
    - re.compile
    - match.group
    - line.rstrip
    - <builtin>.len
    - <builtin>.float
    - tokens.match
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: multilines.append
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.count
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tokens.match
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: match.group
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: group.rstrip
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: enum.Enum.__init__
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: typing.NamedTuple.__init__
    functionSourceFile: ''
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - curr_token
    - expected
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 366
    functionName: networkx.readwrite.gml.parse_gml_lines.unexpected
    functionSourceFile: networkx.readwrite.gml
    functionUses: 7
    functionsReached:
    - <builtin>.repr
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - curr_token
    - category
    - expected
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 371
    functionName: networkx.readwrite.gml.parse_gml_lines.consume
    functionSourceFile: networkx.readwrite.gml
    functionUses: 6
    functionsReached:
    - <builtin>.repr
    - <builtin>.next
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 3
    IfCount: 9
    argCount: 1
    argDefaultValues: []
    argNames:
    - curr_token
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 376
    functionName: networkx.readwrite.gml.parse_gml_lines.parse_kv
    functionSourceFile: networkx.readwrite.gml
    functionUses: 5
    functionsReached:
    - collections.defaultdict
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    - networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    - collections.defaultdict.items
    - networkx.readwrite.gml.parse_gml_lines.parse_dict
    - networkx.readwrite.gml.parse_gml_lines.parse_kv
    - <builtin>.len
    - <builtin>.str
    - re.sub
    - networkx.readwrite.gml.parse_gml_lines.consume
    - <builtin>.float
    - <builtin>.isinstance
    - <builtin>.repr
    - <builtin>.next
    - networkx.readwrite.gml.unescape
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - curr_token
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 443
    functionName: networkx.readwrite.gml.parse_gml_lines.parse_dict
    functionSourceFile: networkx.readwrite.gml
    functionUses: 5
    functionsReached:
    - collections.defaultdict
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    - networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    - collections.defaultdict.items
    - networkx.readwrite.gml.parse_gml_lines.parse_dict
    - networkx.readwrite.gml.parse_gml_lines.parse_kv
    - <builtin>.len
    - networkx.readwrite.gml.parse_gml_lines.consume
    - <builtin>.str
    - re.sub
    - <builtin>.float
    - <builtin>.isinstance
    - <builtin>.repr
    - <builtin>.next
    - networkx.readwrite.gml.unescape
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - value
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 431
    functionName: networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    functionSourceFile: networkx.readwrite.gml
    functionUses: 6
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.defaultdict.items
    functionSourceFile: collections
    functionUses: 221
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 452
    functionName: networkx.readwrite.gml.parse_gml_lines.parse_graph
    functionSourceFile: networkx.readwrite.gml
    functionUses: 3
    functionsReached:
    - collections.defaultdict
    - networkx.readwrite.gml.parse_gml_lines.unexpected
    - networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value
    - collections.defaultdict.items
    - networkx.readwrite.gml.parse_gml_lines.parse_dict
    - networkx.readwrite.gml.parse_gml_lines.parse_kv
    - <builtin>.len
    - <builtin>.str
    - re.sub
    - networkx.readwrite.gml.parse_gml_lines.consume
    - <builtin>.float
    - <builtin>.isinstance
    - <builtin>.repr
    - <builtin>.next
    - networkx.readwrite.gml.unescape
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.graph.update
    functionSourceFile: <builtin>
    functionUses: 249
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - dct
    - category
    - attr
    - i
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 475
    functionName: networkx.readwrite.gml.parse_gml_lines.pop_attr
    functionSourceFile: networkx.readwrite.gml
    functionUses: 3
    functionsReached:
    - dct.pop
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dct.pop
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_labels.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.add_node
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.has_edge
    functionSourceFile: <builtin>
    functionUses: 215
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.add_edge
    functionSourceFile: <builtin>
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.relabel_nodes
    functionSourceFile: ''
    functionUses: 212
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - value
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 525
    functionName: networkx.readwrite.gml.literal_stringizer
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - networkx.readwrite.gml.literal_stringizer.stringize
    - io.StringIO.write
    - io.StringIO.getvalue
    - value.encode
    - value.items
    - <builtin>.len
    - <builtin>.str
    - <builtin>.isinstance
    - <builtin>.repr
    - io.StringIO
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 16
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 23
    ICount: 28
    IfCount: 16
    argCount: 1
    argDefaultValues: []
    argNames:
    - value
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 550
    functionName: networkx.readwrite.gml.literal_stringizer.stringize
    functionSourceFile: networkx.readwrite.gml
    functionUses: 1
    functionsReached:
    - networkx.readwrite.gml.literal_stringizer.stringize
    - io.StringIO.write
    - value.encode
    - value.items
    - <builtin>.len
    - <builtin>.str
    - <builtin>.isinstance
    - <builtin>.repr
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: io.StringIO.write
    functionSourceFile: io
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: value.encode
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: value.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: io.StringIO
    functionSourceFile: io
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: io.StringIO.getvalue
    functionSourceFile: io
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 18
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35e3d0>
    argNames:
    - G
    - stringizer
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 626
    functionName: networkx.readwrite.gml.generate_gml
    functionSourceFile: networkx.readwrite.gml
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - ignored_keys.add
    - value.items
    - networkx.readwrite.gml.generate_gml.stringize
    - <builtin>.str
    - re.compile
    - G.graph.items
    - <builtin>.len
    - attrs.items
    - G.is_directed
    - text.find
    - networkx.readwrite.gml.escape
    - G.is_multigraph
    - <builtin>.float
    - G.nodes.items
    - <builtin>.isinstance
    - G.edges
    - <builtin>.range
    - text.rfind
    - valid_keys.match
    - <builtin>.dict
    - re.sub
    - <builtin>.repr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 20
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 11
    EdgeCount: 29
    ICount: 15
    IfCount: 20
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e640>
    argNames:
    - key
    - value
    - ignored_keys
    - indent
    - in_list
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 711
    functionName: networkx.readwrite.gml.generate_gml.stringize
    functionSourceFile: networkx.readwrite.gml
    functionUses: 2
    functionsReached:
    - text.rfind
    - text.find
    - valid_keys.match
    - value.items
    - <builtin>.len
    - networkx.readwrite.gml.escape
    - <builtin>.str
    - networkx.readwrite.gml.generate_gml.stringize
    - re.sub
    - <builtin>.float
    - <builtin>.isinstance
    - <builtin>.repr
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: valid_keys.match
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: text.rfind
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: text.find
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ignored_keys.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7349406640>
    argNames:
    - G
    - path
    - stringizer
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 818
    functionName: networkx.readwrite.gml.write_gml
    functionSourceFile: networkx.readwrite.gml
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - ignored_keys.add
    - value.items
    - networkx.readwrite.gml.generate_gml.stringize
    - <builtin>.str
    - path.write
    - re.compile
    - G.graph.items
    - <builtin>.len
    - networkx.readwrite.gml.generate_gml
    - attrs.items
    - G.is_directed
    - text.find
    - networkx.readwrite.gml.escape
    - G.is_multigraph
    - <builtin>.float
    - G.nodes.items
    - <builtin>.isinstance
    - G.edges
    - <builtin>.range
    - text.rfind
    - valid_keys.match
    - <builtin>.dict
    - re.sub
    - <builtin>.repr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.graphml
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f73465d7790>
    - <ast.Constant object at 0x7f73465d7760>
    - <ast.Constant object at 0x7f73465d7730>
    - <ast.Constant object at 0x7f73465d7700>
    - <ast.Constant object at 0x7f73465d76d0>
    argNames:
    - G
    - path
    - encoding
    - prettyprint
    - infer_numeric_types
    - named_key_ids
    - edge_id_from_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 63
    functionName: networkx.readwrite.graphml.write_graphml_xml
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 1
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriter.indent
    - xml.etree.ElementTree.Element
    - collections.defaultdict.items
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - elem.tail.strip
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - networkx.readwrite.graphml.GraphMLWriter.dump
    - <builtin>.reversed
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - node_default.get
    - <builtin>.len
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.GraphMLWriter.__init__
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    - networkx.readwrite.graphml.GraphMLWriterLxml.dump
    - d.items
    - <builtin>.list
    - networkx.readwrite.graphml.IncrementalElement.append
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - elem.text.strip
    - collections.defaultdict
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - networkx.readwrite.graphml.GraphMLWriter.add_graph_element
    - xml_obj.append
    - edge_default.get
    - key_element.append
    - xml.etree.ElementTree.ElementTree
    - G.nodes
    - <builtin>.dict
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.GraphML.construct_types
    - G.graph.pop
    - lxml.etree.Element
    - xml.etree.ElementTree.ElementTree.write
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8ac0>
    - <ast.Constant object at 0x7f734aaa8220>
    - <ast.Constant object at 0x7f734aaa8af0>
    - <ast.Constant object at 0x7f734aaa8580>
    - <ast.Constant object at 0x7f734aaa8520>
    - <ast.Constant object at 0x7f734aaa8310>
    argNames:
    - self
    - graph
    - encoding
    - prettyprint
    - infer_numeric_types
    - named_key_ids
    - edge_id_from_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 464
    functionName: networkx.readwrite.graphml.GraphMLWriter.__init__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 3
    functionsReached:
    - xml.etree.ElementTree.Element
    - collections.defaultdict.items
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - <builtin>.reversed
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - <builtin>.len
    - node_default.get
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    - <builtin>.list
    - d.items
    - networkx.readwrite.graphml.IncrementalElement.append
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - collections.defaultdict
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - networkx.readwrite.graphml.GraphMLWriter.add_graph_element
    - xml_obj.append
    - key_element.append
    - edge_default.get
    - G.nodes
    - <builtin>.dict
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.GraphML.construct_types
    - G.graph.pop
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 618
    functionName: networkx.readwrite.graphml.GraphMLWriter.add_graph_element
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 5
    functionsReached:
    - xml.etree.ElementTree.Element
    - collections.defaultdict.items
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - G.graph.items
    - data.get
    - G.graph.get
    - <builtin>.type
    - <builtin>.len
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.graph.pop
    - G.is_directed
    - default.get
    - <builtin>.list
    - G.is_multigraph
    - G.edges
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - xml_obj.append
    - key_element.append
    - G.nodes
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 13
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 749
    functionName: networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 6
    functionsReached:
    - xml.etree.ElementTree.Element
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - node_default.get
    - <builtin>.len
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.graph.pop
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - d.items
    - <builtin>.list
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - edge_default.get
    - key_element.append
    - G.nodes
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - stream
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 662
    functionName: networkx.readwrite.graphml.GraphMLWriter.dump
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 2
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriter.indent
    - xml.etree.ElementTree.ElementTree
    - <builtin>.len
    - elem.tail.strip
    - xml.etree.ElementTree.ElementTree.write
    - elem.text.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e7160>
    argNames:
    - self
    - stream
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 830
    functionName: networkx.readwrite.graphml.GraphMLWriterLxml.dump
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7346841df0>
    - <ast.Constant object at 0x7f7346841dc0>
    - <ast.Constant object at 0x7f7346841d90>
    - <ast.Constant object at 0x7f7346841d60>
    - <ast.Constant object at 0x7f7346841d30>
    argNames:
    - G
    - path
    - encoding
    - prettyprint
    - infer_numeric_types
    - named_key_ids
    - edge_id_from_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 118
    functionName: networkx.readwrite.graphml.write_graphml_lxml
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriterLxml.__init__
    - networkx.readwrite.graphml.GraphMLWriter.indent
    - xml.etree.ElementTree.Element
    - collections.defaultdict.items
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - elem.tail.strip
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - <builtin>.reversed
    - networkx.readwrite.graphml.GraphMLWriter.dump
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - node_default.get
    - <builtin>.len
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - networkx.readwrite.graphml.write_graphml_xml
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.GraphMLWriter.__init__
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    - networkx.readwrite.graphml.GraphMLWriterLxml.dump
    - d.items
    - <builtin>.list
    - networkx.readwrite.graphml.IncrementalElement.append
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - elem.text.strip
    - collections.defaultdict
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - networkx.readwrite.graphml.GraphMLWriter.add_graph_element
    - xml_obj.append
    - lxml.etree.xmlfile
    - edge_default.get
    - key_element.append
    - xml.etree.ElementTree.ElementTree
    - G.nodes
    - <builtin>.dict
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.GraphML.construct_types
    - G.graph.pop
    - lxml.etree.Element
    - xml.etree.ElementTree.ElementTree.write
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734cdf4a90>
    - <ast.Constant object at 0x7f734cdf4fd0>
    - <ast.Constant object at 0x7f734cdf4c40>
    - <ast.Constant object at 0x7f734cdf4b50>
    - <ast.Constant object at 0x7f734c8de850>
    - <ast.Constant object at 0x7f734c8de130>
    argNames:
    - self
    - path
    - graph
    - encoding
    - prettyprint
    - infer_numeric_types
    - named_key_ids
    - edge_id_from_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 703
    functionName: networkx.readwrite.graphml.GraphMLWriterLxml.__init__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 1
    functionsReached:
    - xml.etree.ElementTree.Element
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - <builtin>.reversed
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - node_default.get
    - <builtin>.len
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    - d.items
    - <builtin>.list
    - networkx.readwrite.graphml.IncrementalElement.append
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - collections.defaultdict
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - lxml.etree.xmlfile
    - edge_default.get
    - key_element.append
    - G.nodes
    - <builtin>.dict
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.GraphML.construct_types
    - G.graph.pop
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7346874670>
    - <ast.Constant object at 0x7f7346874640>
    - <ast.Constant object at 0x7f7346874610>
    - <ast.Constant object at 0x7f73468745e0>
    argNames:
    - G
    - encoding
    - prettyprint
    - named_key_ids
    - edge_id_from_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 189
    functionName: networkx.readwrite.graphml.generate_graphml
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - xml.etree.ElementTree.Element
    - collections.defaultdict.items
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - <builtin>.reversed
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - <builtin>.len
    - node_default.get
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.graph.pop
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.GraphMLWriter.__init__
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    - <builtin>.list
    - d.items
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - collections.defaultdict
    - networkx.readwrite.graphml.GraphMLWriter.add_graph_element
    - xml_obj.append
    - key_element.append
    - edge_default.get
    - G.nodes
    - <builtin>.dict
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.GraphML.construct_types
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Name object at 0x7f73461bdeb0>
    - <ast.Name object at 0x7f73461bde80>
    - <ast.Constant object at 0x7f73461bde50>
    argNames:
    - path
    - node_type
    - edge_key_type
    - force_multigraph
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 238
    functionName: networkx.readwrite.graphml.read_graphml
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - <builtin>.reversed
    - path.read
    - <builtin>.list
    - path.seek
    - <builtin>.len
    - <builtin>.dict
    - networkx.readwrite.graphml.GraphML.construct_types
    - old_bytes.replace
    - networkx.readwrite.graphml.GraphMLReader.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Name object at 0x7f734d3a39d0>
    - <ast.Name object at 0x7f734d3a3cd0>
    - <ast.Constant object at 0x7f734d3a3400>
    argNames:
    - self
    - node_type
    - edge_key_type
    - force_multigraph
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 842
    functionName: networkx.readwrite.graphml.GraphMLReader.__init__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 2
    functionsReached:
    - <builtin>.dict
    - <builtin>.reversed
    - networkx.readwrite.graphml.GraphML.construct_types
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.seek
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: old_bytes.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Name object at 0x7f734cc98310>
    - <ast.Name object at 0x7f734cc983d0>
    - <ast.Constant object at 0x7f734cc98580>
    argNames:
    - graphml_string
    - node_type
    - edge_key_type
    - force_multigraph
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 311
    functionName: networkx.readwrite.graphml.parse_graphml
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - <builtin>.reversed
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - graphml_string.replace
    - networkx.readwrite.graphml.GraphML.construct_types
    - networkx.readwrite.graphml.GraphMLReader.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphml_string.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 396
    functionName: networkx.readwrite.graphml.GraphML.construct_types
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 8
    functionsReached:
    - <builtin>.dict
    - <builtin>.reversed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 451
    functionName: networkx.readwrite.graphml.GraphML.get_xml_type
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lxml.etree.Element
    functionSourceFile: lxml
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element
    functionSourceFile: xml
    functionUses: 25
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 498
    functionName: networkx.readwrite.graphml.GraphMLWriter.__str__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriter.indent
    - xml.etree.ElementTree.tostring
    - <builtin>.len
    - elem.tail.strip
    - xml.etree.ElementTree.tostring.decode
    - elem.text.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65ebe0>
    argNames:
    - self
    - elem
    - level
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 670
    functionName: networkx.readwrite.graphml.GraphMLWriter.indent
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 4
    functionsReached:
    - <builtin>.len
    - elem.tail.strip
    - networkx.readwrite.graphml.GraphMLWriter.indent
    - elem.text.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.tostring
    functionSourceFile: xml
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.tostring.decode
    functionSourceFile: xml
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - name
    - scope
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 506
    functionName: networkx.readwrite.graphml.GraphMLWriter.attr_type
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 11
    functionsReached:
    - <builtin>.len
    - <builtin>.type
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - name
    - attr_type
    - scope
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 531
    functionName: networkx.readwrite.graphml.GraphMLWriter.get_key
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 12
    functionsReached:
    - key_element.append
    - xml.etree.ElementTree.Element
    - <builtin>.list
    - <builtin>.len
    - <builtin>.str
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: key_element.append
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5e1040>
    - <ast.Constant object at 0x7f734b5e1f70>
    argNames:
    - self
    - name
    - element_type
    - value
    - scope
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 557
    functionName: networkx.readwrite.graphml.GraphMLWriter.add_data
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 11
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - key_element.append
    - xml.etree.ElementTree.Element
    - <builtin>.list
    - <builtin>.len
    - <builtin>.str
    - lxml.etree.Element
    - networkx.readwrite.graphml.GraphML.get_xml_type
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - scope
    - xml_obj
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 571
    functionName: networkx.readwrite.graphml.GraphMLWriter.add_attributes
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - data.items
    - <builtin>.str
    - <builtin>.type
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G
    - graph_element
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 579
    functionName: networkx.readwrite.graphml.GraphMLWriter.add_nodes
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 8
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - default.get
    - key_element.append
    - xml.etree.ElementTree.Element
    - G.nodes
    - <builtin>.list
    - G.graph.get
    - data.items
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.type
    - <builtin>.str
    - <builtin>.len
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - networkx.readwrite.graphml.GraphML.get_xml_type
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.graph.get
    functionSourceFile: <builtin>
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - scope
    - xml_obj
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 819
    functionName: networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 10
    functionsReached:
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - default.get
    - key_element.append
    - xml.etree.ElementTree.Element
    - <builtin>.list
    - data.items
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.type
    - <builtin>.len
    - <builtin>.str
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    - networkx.readwrite.graphml.GraphML.get_xml_type
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - element
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 698
    functionName: networkx.readwrite.graphml.IncrementalElement.append
    functionSourceFile: ''
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G
    - graph_element
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 586
    functionName: networkx.readwrite.graphml.GraphMLWriter.add_edges
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 8
    functionsReached:
    - xml.etree.ElementTree.Element
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - data.get
    - G.graph.get
    - data.items
    - <builtin>.type
    - <builtin>.len
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - default.get
    - <builtin>.list
    - G.is_multigraph
    - G.edges
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - key_element.append
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.graph.pop
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml_obj.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph_list
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 657
    functionName: networkx.readwrite.graphml.GraphMLWriter.add_graphs
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - xml.etree.ElementTree.Element
    - collections.defaultdict.items
    - networkx.readwrite.graphml.GraphMLWriter.add_edges
    - networkx.readwrite.graphml.GraphMLWriter.attr_type
    - <builtin>.str
    - networkx.readwrite.graphml.GraphML.get_xml_type
    - networkx.readwrite.graphml.GraphMLWriter.add_data
    - G.graph.items
    - <builtin>.type
    - data.get
    - G.graph.get
    - <builtin>.len
    - node_default.get
    - data.items
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes
    - G.graph.pop
    - G.is_directed
    - default.get
    - networkx.readwrite.graphml.IncrementalElement.__init__
    - networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element
    - <builtin>.list
    - d.items
    - G.is_multigraph
    - graphdata.items
    - G.edges
    - networkx.readwrite.graphml.GraphMLWriter.get_key
    - networkx.readwrite.graphml.GraphMLWriter.add_graph_element
    - xml_obj.append
    - key_element.append
    - edge_default.get
    - G.nodes
    - networkx.readwrite.graphml.GraphMLWriter.add_nodes
    - networkx.readwrite.graphml.IncrementalElement.append
    - lxml.etree.Element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.ElementTree
    functionSourceFile: xml
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.ElementTree.write
    functionSourceFile: xml
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: elem.text.strip
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: elem.tail.strip
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - xml
    - prettyprint
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 694
    functionName: networkx.readwrite.graphml.IncrementalElement.__init__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lxml.etree.xmlfile
    functionSourceFile: lxml
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphdata.items
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_default.get
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_default.get
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: default.get
    functionSourceFile: <builtin>
    functionUses: 19
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 827
    functionName: networkx.readwrite.graphml.GraphMLWriterLxml.__str__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - object.__str__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: object.__str__
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5f02e0>
    - <ast.Constant object at 0x7f734b5f0700>
    argNames:
    - self
    - path
    - string
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 849
    functionName: networkx.readwrite.graphml.GraphMLReader.__call__
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 0
    functionsReached:
    - xml.etree.ElementTree.fromstring
    - networkx.readwrite.graphml.GraphMLReader.add_edge
    - G.graph.update
    - edge_element.get
    - defaults.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.readwrite.graphml.GraphMLReader.add_node
    - geometry.get
    - keylist.append
    - xml.etree.ElementTree.fromstring.findall
    - warnings.warn
    - default.text.lower
    - k.find
    - networkx.readwrite.graphml.GraphMLReader.make_graph
    - datadict.update
    - gn.get
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - k.get
    - shape.get
    - data.get
    - <builtin>.len
    - xml.etree.ElementTree.ElementTree.findall
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - edge_element.find
    - networkx.readwrite.graphml.GraphMLReader.find_graphml_keys
    - attr_dict.update
    - networkx.readwrite.graphml.GraphMLReader.decode_data_elements
    - data_element.find
    - node_xml.find
    - networkx.classes.multigraph.MultiGraph.has_edge
    - graph_xml.get
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - node_xml.get
    - graph_xml.findall
    - obj_xml.findall
    - networkx.classes.graph.Graph.add_node
    - xml.etree.ElementTree.ElementTree
    - graph_xml.find
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.set_edge_attributes
    - text.lower
    - node_xml.attrib.get
    - data_element.get
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.fromstring
    functionSourceFile: xml
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph_element
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1020
    functionName: networkx.readwrite.graphml.GraphMLReader.find_graphml_keys
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 1
    functionsReached:
    - k.get
    - k.find
    - xml.etree.ElementTree.ElementTree.findall
    - xml.etree.ElementTree.fromstring.findall
    - warnings.warn
    - default.text.lower
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.fromstring.findall
    functionSourceFile: xml
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.ElementTree.findall
    functionSourceFile: xml
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 6
    IfCount: 6
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734c3fbfd0>
    argNames:
    - self
    - graph_xml
    - graphml_keys
    - defaults
    - G
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 862
    functionName: networkx.readwrite.graphml.GraphMLReader.make_graph
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 2
    functionsReached:
    - networkx.readwrite.graphml.GraphMLReader.add_edge
    - G.graph.update
    - edge_element.get
    - defaults.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.readwrite.graphml.GraphMLReader.add_node
    - geometry.get
    - keylist.append
    - warnings.warn
    - networkx.readwrite.graphml.GraphMLReader.make_graph
    - datadict.update
    - gn.get
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - shape.get
    - data.get
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - edge_element.find
    - attr_dict.update
    - networkx.readwrite.graphml.GraphMLReader.decode_data_elements
    - data_element.find
    - node_xml.find
    - networkx.classes.multigraph.MultiGraph.has_edge
    - graph_xml.get
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - node_xml.get
    - graph_xml.findall
    - obj_xml.findall
    - networkx.classes.graph.Graph.add_node
    - graph_xml.find
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.set_edge_attributes
    - text.lower
    - node_xml.attrib.get
    - data_element.get
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_xml.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: defaults.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_xml.find
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_xml.findall
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - G
    - node_xml
    - graphml_keys
    - defaults
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 904
    functionName: networkx.readwrite.graphml.GraphMLReader.add_node
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 2
    functionsReached:
    - networkx.readwrite.graphml.GraphMLReader.add_edge
    - G.graph.update
    - edge_element.get
    - defaults.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.readwrite.graphml.GraphMLReader.add_node
    - geometry.get
    - keylist.append
    - warnings.warn
    - networkx.readwrite.graphml.GraphMLReader.make_graph
    - datadict.update
    - gn.get
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - shape.get
    - data.get
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - edge_element.find
    - attr_dict.update
    - networkx.readwrite.graphml.GraphMLReader.decode_data_elements
    - data_element.find
    - node_xml.find
    - networkx.classes.multigraph.MultiGraph.has_edge
    - graph_xml.get
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - node_xml.get
    - graph_xml.findall
    - obj_xml.findall
    - networkx.classes.graph.Graph.add_node
    - graph_xml.find
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.set_edge_attributes
    - text.lower
    - node_xml.attrib.get
    - data_element.get
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - G
    - edge_element
    - graphml_keys
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 920
    functionName: networkx.readwrite.graphml.GraphMLReader.add_edge
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 3
    functionsReached:
    - edge_element.get
    - keydict.get
    - geometry.get
    - keylist.append
    - warnings.warn
    - datadict.update
    - gn.get
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - shape.get
    - data.get
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - edge_element.find
    - networkx.readwrite.graphml.GraphMLReader.decode_data_elements
    - data_element.find
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - obj_xml.findall
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multigraph.MultiGraph.is_directed
    - text.lower
    - data_element.get
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 1
    IfCount: 11
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - graphml_keys
    - obj_xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 961
    functionName: networkx.readwrite.graphml.GraphMLReader.decode_data_elements
    functionSourceFile: networkx.readwrite.graphml
    functionUses: 4
    functionsReached:
    - data_element.find
    - gn.get
    - shape.get
    - <builtin>.list
    - <builtin>.len
    - text.lower
    - geometry.get
    - data_element.get
    - obj_xml.findall
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_xml.find
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_xml.get
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_xml.attrib.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_element.find
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_element.get
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: obj_xml.findall
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data_element.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: text.lower
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data_element.find
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gn.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: geometry.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: shape.get
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.find
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: default.text.lower
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.gexf
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734922fd60>
    - <ast.Constant object at 0x7f734922fd30>
    - <ast.Constant object at 0x7f734922fd00>
    argNames:
    - G
    - path
    - encoding
    - prettyprint
    - version
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 37
    functionName: networkx.readwrite.gexf.write_gexf
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 0
    functionsReached:
    - xml.etree.ElementTree.SubElement
    - networkx.readwrite.gexf.GEXFWriter.indent
    - node_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_nodes
    - xml.etree.ElementTree.Element
    - color.get
    - xml.etree.ElementTree.Element.insert
    - data.copy
    - xml.etree.ElementTree.Element.get
    - networkx.readwrite.gexf.GEXFWriter.add_attributes
    - time.strftime
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_spells
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - networkx.readwrite.gexf.GEXFWriter.__init__
    - viz.get
    - xml.etree.ElementTree.register_namespace
    - networkx.readwrite.gexf.GEXFWriter.add_viz
    - position.get
    - <builtin>.reversed
    - networkx.readwrite.gexf.GEXF.set_version
    - <builtin>.type
    - G.graph.get
    - <builtin>.len
    - edge_data.pop
    - <builtin>.set
    - xml.etree.ElementTree.Element.tail.strip
    - data.items
    - networkx.readwrite.gexf.GEXFWriter.add_slices
    - networkx.readwrite.gexf.GEXFWriter.add_parents
    - <builtin>.next
    - networkx.readwrite.gexf.GEXFWriter.add_graph
    - networkx.readwrite.gexf.GEXF.construct_types
    - xml.etree.ElementTree.Element.append
    - xml.etree.ElementTree.Element.set
    - G.is_directed
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data
    - default.get
    - networkx.readwrite.gexf.GEXFWriter.write
    - networkx.readwrite.gexf.GEXFWriter.add_edges
    - edge_data.update
    - itertools.count
    - G.is_multigraph
    - <builtin>.isinstance
    - shape.startswith
    - G.edges
    - xml.etree.ElementTree.Element.findall
    - xml.etree.ElementTree.ElementTree
    - xml.etree.ElementTree.Element.text.strip
    - G.nodes
    - <builtin>.dict
    - xml.etree.ElementTree.ElementTree.write
    - a.get
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734c426c70>
    - <ast.Constant object at 0x7f734c426e50>
    - <ast.Constant object at 0x7f734c426670>
    - <ast.Constant object at 0x7f734c426100>
    argNames:
    - self
    - graph
    - encoding
    - prettyprint
    - version
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 298
    functionName: networkx.readwrite.gexf.GEXFWriter.__init__
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 2
    functionsReached:
    - xml.etree.ElementTree.SubElement
    - node_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_nodes
    - xml.etree.ElementTree.Element
    - color.get
    - xml.etree.ElementTree.Element.insert
    - data.copy
    - xml.etree.ElementTree.Element.get
    - networkx.readwrite.gexf.GEXFWriter.add_attributes
    - time.strftime
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_spells
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - viz.get
    - xml.etree.ElementTree.register_namespace
    - networkx.readwrite.gexf.GEXFWriter.add_viz
    - position.get
    - <builtin>.reversed
    - networkx.readwrite.gexf.GEXF.set_version
    - <builtin>.type
    - G.graph.get
    - edge_data.pop
    - data.items
    - <builtin>.set
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFWriter.add_slices
    - networkx.readwrite.gexf.GEXFWriter.add_parents
    - <builtin>.next
    - networkx.readwrite.gexf.GEXFWriter.add_graph
    - networkx.readwrite.gexf.GEXF.construct_types
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - xml.etree.ElementTree.Element.set
    - G.is_directed
    - xml.etree.ElementTree.Element.append
    - networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data
    - default.get
    - networkx.readwrite.gexf.GEXFWriter.add_edges
    - edge_data.update
    - itertools.count
    - G.is_multigraph
    - <builtin>.isinstance
    - shape.startswith
    - G.edges
    - xml.etree.ElementTree.Element.findall
    - G.nodes
    - <builtin>.dict
    - a.get
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 347
    functionName: networkx.readwrite.gexf.GEXFWriter.add_graph
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 3
    functionsReached:
    - node_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_nodes
    - xml.etree.ElementTree.Element
    - color.get
    - xml.etree.ElementTree.Element.insert
    - data.copy
    - xml.etree.ElementTree.Element.get
    - networkx.readwrite.gexf.GEXFWriter.add_attributes
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_spells
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - viz.get
    - networkx.readwrite.gexf.GEXFWriter.add_viz
    - position.get
    - <builtin>.type
    - G.graph.get
    - edge_data.pop
    - data.items
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFWriter.add_slices
    - networkx.readwrite.gexf.GEXFWriter.add_parents
    - <builtin>.next
    - xml.etree.ElementTree.Element.append
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - xml.etree.ElementTree.Element.set
    - G.is_directed
    - networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data
    - default.get
    - networkx.readwrite.gexf.GEXFWriter.add_edges
    - edge_data.update
    - G.is_multigraph
    - <builtin>.isinstance
    - shape.startswith
    - G.edges
    - xml.etree.ElementTree.Element.findall
    - G.nodes
    - a.get
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - fh
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 683
    functionName: networkx.readwrite.gexf.GEXFWriter.write
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 1
    functionsReached:
    - networkx.readwrite.gexf.GEXFWriter.indent
    - xml.etree.ElementTree.ElementTree
    - xml.etree.ElementTree.Element.text.strip
    - <builtin>.len
    - xml.etree.ElementTree.Element.tail.strip
    - xml.etree.ElementTree.ElementTree.write
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734923abb0>
    - <ast.Constant object at 0x7f734923ab80>
    - <ast.Constant object at 0x7f734923ab50>
    argNames:
    - G
    - encoding
    - prettyprint
    - version
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 99
    functionName: networkx.readwrite.gexf.generate_gexf
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 0
    functionsReached:
    - xml.etree.ElementTree.SubElement
    - node_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_nodes
    - xml.etree.ElementTree.Element
    - color.get
    - xml.etree.ElementTree.Element.insert
    - data.copy
    - xml.etree.ElementTree.Element.get
    - networkx.readwrite.gexf.GEXFWriter.add_attributes
    - time.strftime
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_spells
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - networkx.readwrite.gexf.GEXFWriter.__init__
    - viz.get
    - xml.etree.ElementTree.register_namespace
    - networkx.readwrite.gexf.GEXFWriter.add_viz
    - position.get
    - <builtin>.reversed
    - networkx.readwrite.gexf.GEXF.set_version
    - <builtin>.type
    - G.graph.get
    - edge_data.pop
    - data.items
    - <builtin>.set
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFWriter.add_slices
    - networkx.readwrite.gexf.GEXFWriter.add_parents
    - <builtin>.next
    - networkx.readwrite.gexf.GEXFWriter.add_graph
    - networkx.readwrite.gexf.GEXF.construct_types
    - xml.etree.ElementTree.Element.append
    - xml.etree.ElementTree.Element.set
    - G.is_directed
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data
    - default.get
    - networkx.readwrite.gexf.GEXFWriter.add_edges
    - edge_data.update
    - itertools.count
    - G.is_multigraph
    - <builtin>.isinstance
    - shape.startswith
    - G.edges
    - xml.etree.ElementTree.Element.findall
    - G.nodes
    - <builtin>.dict
    - a.get
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734923a4c0>
    - <ast.Constant object at 0x7f734923a490>
    - <ast.Constant object at 0x7f734923a460>
    argNames:
    - path
    - node_type
    - relabel
    - version
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 146
    functionName: networkx.readwrite.gexf.read_gexf
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - networkx.readwrite.gexf.GEXF.set_version
    - networkx.readwrite.gexf.GEXFReader.__init__
    - <builtin>.reversed
    - networkx.readwrite.gexf.relabel_gexf_graph
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.len
    - networkx.relabel_nodes
    - networkx.readwrite.gexf.GEXF.construct_types
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7349237cd0>
    - <ast.Constant object at 0x7f7349237ca0>
    argNames:
    - self
    - node_type
    - version
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 710
    functionName: networkx.readwrite.gexf.GEXFReader.__init__
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 1
    functionsReached:
    - <builtin>.dict
    - networkx.readwrite.gexf.GEXF.set_version
    - <builtin>.reversed
    - networkx.readwrite.gexf.GEXF.construct_types
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1037
    functionName: networkx.readwrite.gexf.relabel_gexf_graph
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - <builtin>.dict
    - <builtin>.len
    - <builtin>.set
    - networkx.relabel_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 229
    functionName: networkx.readwrite.gexf.GEXF.construct_types
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 5
    functionsReached:
    - <builtin>.dict
    - <builtin>.reversed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - version
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 283
    functionName: networkx.readwrite.gexf.GEXF.set_version
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.SubElement
    functionSourceFile: xml
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: time.strftime
    functionSourceFile: time
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.set
    functionSourceFile: xml
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.append
    functionSourceFile: xml
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.register_namespace
    functionSourceFile: xml
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 341
    functionName: networkx.readwrite.gexf.GEXFWriter.__str__
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 0
    functionsReached:
    - networkx.readwrite.gexf.GEXFWriter.indent
    - xml.etree.ElementTree.tostring
    - xml.etree.ElementTree.Element.text.strip
    - <builtin>.len
    - xml.etree.ElementTree.Element.tail.strip
    - xml.etree.ElementTree.tostring.decode
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7349212e20>
    argNames:
    - self
    - elem
    - level
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 690
    functionName: networkx.readwrite.gexf.GEXFWriter.indent
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 3
    functionsReached:
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFWriter.indent
    - xml.etree.ElementTree.Element.tail.strip
    - xml.etree.ElementTree.Element.text.strip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dd.get
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G
    - graph_element
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 370
    functionName: networkx.readwrite.gexf.GEXFWriter.add_nodes
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 4
    functionsReached:
    - node_data.pop
    - xml.etree.ElementTree.Element
    - color.get
    - xml.etree.ElementTree.Element.insert
    - data.copy
    - xml.etree.ElementTree.Element.get
    - networkx.readwrite.gexf.GEXFWriter.add_attributes
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_spells
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - viz.get
    - networkx.readwrite.gexf.GEXFWriter.add_viz
    - position.get
    - <builtin>.type
    - G.graph.get
    - data.items
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFWriter.add_slices
    - <builtin>.next
    - xml.etree.ElementTree.Element.append
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - xml.etree.ElementTree.Element.set
    - default.get
    - <builtin>.isinstance
    - shape.startswith
    - xml.etree.ElementTree.Element.findall
    - G.nodes
    - a.get
    - networkx.readwrite.gexf.GEXFWriter.add_parents
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G
    - graph_element
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 409
    functionName: networkx.readwrite.gexf.GEXFWriter.add_edges
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 4
    functionsReached:
    - node_data.pop
    - xml.etree.ElementTree.Element
    - color.get
    - xml.etree.ElementTree.Element.insert
    - data.copy
    - xml.etree.ElementTree.Element.get
    - networkx.readwrite.gexf.GEXFWriter.add_attributes
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.add_spells
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - viz.get
    - networkx.readwrite.gexf.GEXFWriter.add_viz
    - position.get
    - <builtin>.type
    - edge_data.pop
    - G.graph.get
    - data.items
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFWriter.add_slices
    - <builtin>.next
    - xml.etree.ElementTree.Element.append
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - xml.etree.ElementTree.Element.set
    - networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data
    - default.get
    - edge_data.update
    - G.is_multigraph
    - <builtin>.isinstance
    - shape.startswith
    - G.edges
    - xml.etree.ElementTree.Element.findall
    - a.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data.copy
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - start_or_end
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 665
    functionName: networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 8
    functionsReached:
    - <builtin>.isinstance
    - xml.etree.ElementTree.Element.get
    - xml.etree.ElementTree.Element.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - node_element
    - node_data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 628
    functionName: networkx.readwrite.gexf.GEXFWriter.add_parents
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 5
    functionsReached:
    - xml.etree.ElementTree.Element
    - node_data.pop
    - <builtin>.str
    - xml.etree.ElementTree.Element.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - node_or_edge_element
    - node_or_edge_data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 639
    functionName: networkx.readwrite.gexf.GEXFWriter.add_slices
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 6
    functionsReached:
    - xml.etree.ElementTree.Element
    - <builtin>.str
    - node_or_edge_data.pop
    - xml.etree.ElementTree.Element.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - node_or_edge_element
    - node_or_edge_data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 649
    functionName: networkx.readwrite.gexf.GEXFWriter.add_spells
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 6
    functionsReached:
    - xml.etree.ElementTree.Element.set
    - xml.etree.ElementTree.Element
    - xml.etree.ElementTree.Element.get
    - <builtin>.str
    - node_or_edge_data.pop
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - xml.etree.ElementTree.Element.append
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 5
    IfCount: 8
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - element
    - node_data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 575
    functionName: networkx.readwrite.gexf.GEXFWriter.add_viz
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 6
    functionsReached:
    - node_data.pop
    - position.get
    - color.get
    - xml.etree.ElementTree.Element
    - <builtin>.str
    - viz.get
    - shape.startswith
    - xml.etree.ElementTree.Element.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 16
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 23
    ICount: 5
    IfCount: 16
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - node_or_edge
    - xml_obj
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 477
    functionName: networkx.readwrite.gexf.GEXFWriter.add_attributes
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 6
    functionsReached:
    - xml.etree.ElementTree.Element.findall
    - default.get
    - xml.etree.ElementTree.Element.set
    - xml.etree.ElementTree.Element
    - xml.etree.ElementTree.Element.insert
    - xml.etree.ElementTree.Element.get
    - a.get
    - <builtin>.type
    - data.items
    - <builtin>.len
    - <builtin>.str
    - networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat
    - <builtin>.next
    - xml.etree.ElementTree.Element.append
    - networkx.readwrite.gexf.GEXFWriter.get_attr_id
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 410
    functionName: networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 5
    functionsReached:
    - data.copy
    - edge_data.update
    - edge_data.pop
    - G.is_multigraph
    - <builtin>.str
    - <builtin>.next
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_data.update
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_data.pop
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 6
    argDefaultValues: []
    argNames:
    - self
    - title
    - attr_type
    - edge_or_node
    - default
    - mode
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 543
    functionName: networkx.readwrite.gexf.GEXFWriter.get_attr_id
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 7
    functionsReached:
    - xml.etree.ElementTree.Element.findall
    - default.get
    - xml.etree.ElementTree.Element
    - xml.etree.ElementTree.Element.insert
    - <builtin>.str
    - <builtin>.next
    - a.get
    - xml.etree.ElementTree.Element.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.findall
    functionSourceFile: xml
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: a.get
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.insert
    functionSourceFile: xml
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: viz.get
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: color.get
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: shape.startswith
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: position.get
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_or_edge_data.pop
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.get
    functionSourceFile: xml
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.text.strip
    functionSourceFile: xml
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.Element.tail.strip
    functionSourceFile: xml
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - stream
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 717
    functionName: networkx.readwrite.gexf.GEXFReader.__call__
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 0
    functionsReached:
    - networkx.readwrite.gexf.GEXFReader.add_slices
    - networkx.readwrite.gexf.GEXFReader.add_node
    - node_or_edge_xml.find
    - color.get
    - edge_element.get
    - networkx.readwrite.gexf.GEXFReader.make_graph
    - networkx.classes.digraph.DiGraph.add_node
    - s.get
    - keydict.get
    - networkx.readwrite.gexf.GEXFReader.find_gexf_attributes
    - p.get
    - node_attr.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - k.find
    - thickness.get
    - xml.get
    - position.get
    - <builtin>.int
    - datadict.update
    - networkx.readwrite.gexf.GEXFReader.add_edge
    - networkx.readwrite.gexf.GEXF.set_version
    - attributes_element.findall
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - k.get
    - shape.get
    - networkx.classes.graph.Graph.is_directed
    - obj_xml.find
    - <builtin>.len
    - edge_attr.update
    - networkx.classes.graph.Graph.has_edge
    - networkx.readwrite.gexf.GEXFReader.add_spells
    - attr_dict.update
    - node_xml.find
    - edge_default.update
    - networkx.readwrite.gexf.GEXFReader.add_start_end
    - spells_element.findall
    - graph_xml.get
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - nodes_element.findall
    - networkx.readwrite.gexf.GEXFReader.decode_attr_elements
    - node_xml.get
    - graph_xml.findall
    - size.get
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.float
    - networkx.readwrite.gexf.GEXFReader.add_viz
    - parents_element.findall
    - networkx.classes.graph.Graph.add_node
    - xml.etree.ElementTree.ElementTree
    - graph_xml.find
    - xml.etree.ElementTree.ElementTree.find
    - attributes_element.get
    - networkx.readwrite.gexf.GEXFReader.add_parents
    - attr_element.findall
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - edges_element.findall
    - networkx.classes.digraph.DiGraph.is_directed
    - subnodes.findall
    - networkx.classes.multigraph.MultiGraph.is_directed
    - slices_element.findall
    - node_default.update
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - data.pop
    - a.get
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.etree.ElementTree.ElementTree.find
    functionSourceFile: xml
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 8
    IfCount: 12
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph_xml
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 730
    functionName: networkx.readwrite.gexf.GEXFReader.make_graph
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 1
    functionsReached:
    - networkx.readwrite.gexf.GEXFReader.add_node
    - networkx.readwrite.gexf.GEXFReader.add_slices
    - node_or_edge_xml.find
    - color.get
    - edge_element.get
    - networkx.classes.digraph.DiGraph.add_node
    - s.get
    - keydict.get
    - networkx.readwrite.gexf.GEXFReader.find_gexf_attributes
    - p.get
    - node_attr.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - k.find
    - thickness.get
    - xml.get
    - position.get
    - <builtin>.int
    - datadict.update
    - networkx.readwrite.gexf.GEXFReader.add_edge
    - attributes_element.findall
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - k.get
    - shape.get
    - networkx.classes.graph.Graph.is_directed
    - obj_xml.find
    - <builtin>.len
    - edge_attr.update
    - networkx.classes.graph.Graph.has_edge
    - networkx.readwrite.gexf.GEXFReader.add_spells
    - attr_dict.update
    - node_xml.find
    - edge_default.update
    - networkx.readwrite.gexf.GEXFReader.add_start_end
    - spells_element.findall
    - graph_xml.get
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - nodes_element.findall
    - networkx.readwrite.gexf.GEXFReader.decode_attr_elements
    - node_xml.get
    - graph_xml.findall
    - size.get
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.float
    - networkx.readwrite.gexf.GEXFReader.add_viz
    - parents_element.findall
    - networkx.classes.graph.Graph.add_node
    - graph_xml.find
    - networkx.readwrite.gexf.GEXFReader.add_parents
    - attr_element.findall
    - attributes_element.get
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - edges_element.findall
    - networkx.classes.digraph.DiGraph.is_directed
    - subnodes.findall
    - networkx.classes.multigraph.MultiGraph.is_directed
    - slices_element.findall
    - node_default.update
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - data.pop
    - a.get
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - attributes_element
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1016
    functionName: networkx.readwrite.gexf.GEXFReader.find_gexf_attributes
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 2
    functionsReached:
    - attributes_element.get
    - attributes_element.findall
    - k.get
    - k.find
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_attr.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_default.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_attr.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_default.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes_element.findall
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734923ca00>
    argNames:
    - self
    - G
    - node_xml
    - node_attr
    - node_pid
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 809
    functionName: networkx.readwrite.gexf.GEXFReader.add_node
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 2
    functionsReached:
    - networkx.readwrite.gexf.GEXFReader.add_slices
    - networkx.readwrite.gexf.GEXFReader.add_node
    - node_or_edge_xml.find
    - color.get
    - networkx.classes.digraph.DiGraph.add_node
    - s.get
    - p.get
    - thickness.get
    - xml.get
    - position.get
    - <builtin>.int
    - shape.get
    - obj_xml.find
    - <builtin>.len
    - networkx.readwrite.gexf.GEXFReader.add_spells
    - attr_dict.update
    - node_xml.find
    - networkx.readwrite.gexf.GEXFReader.add_start_end
    - spells_element.findall
    - networkx.readwrite.gexf.GEXFReader.decode_attr_elements
    - node_xml.get
    - parents_element.findall
    - size.get
    - <builtin>.float
    - networkx.readwrite.gexf.GEXFReader.add_viz
    - networkx.classes.graph.Graph.add_node
    - networkx.readwrite.gexf.GEXFReader.add_parents
    - attr_element.findall
    - subnodes.findall
    - slices_element.findall
    - a.get
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges_element.findall
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 2
    IfCount: 10
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - G
    - edge_element
    - edge_attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 930
    functionName: networkx.readwrite.gexf.GEXFReader.add_edge
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 2
    functionsReached:
    - networkx.readwrite.gexf.GEXFReader.add_slices
    - node_or_edge_xml.find
    - edge_element.get
    - s.get
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - xml.get
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - obj_xml.find
    - networkx.classes.graph.Graph.has_edge
    - networkx.readwrite.gexf.GEXFReader.add_spells
    - networkx.readwrite.gexf.GEXFReader.add_start_end
    - networkx.classes.multigraph.MultiGraph.has_edge
    - spells_element.findall
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.readwrite.gexf.GEXFReader.decode_attr_elements
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - attr_element.findall
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - slices_element.findall
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - data.pop
    - a.get
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - gexf_keys
    - obj_xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 982
    functionName: networkx.readwrite.gexf.GEXFReader.decode_attr_elements
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 4
    functionsReached:
    - attr_element.findall
    - obj_xml.find
    - a.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - data
    - node_xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 900
    functionName: networkx.readwrite.gexf.GEXFReader.add_parents
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 3
    functionsReached:
    - node_xml.find
    - parents_element.findall
    - p.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - data
    - node_or_edge_xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 909
    functionName: networkx.readwrite.gexf.GEXFReader.add_slices
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 4
    functionsReached:
    - node_or_edge_xml.find
    - s.get
    - slices_element.findall
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - data
    - node_or_edge_xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 919
    functionName: networkx.readwrite.gexf.GEXFReader.add_spells
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 4
    functionsReached:
    - node_or_edge_xml.find
    - spells_element.findall
    - s.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 0
    IfCount: 8
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - data
    - node_xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 855
    functionName: networkx.readwrite.gexf.GEXFReader.add_viz
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 3
    functionsReached:
    - thickness.get
    - position.get
    - <builtin>.int
    - node_xml.find
    - color.get
    - shape.get
    - <builtin>.len
    - size.get
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - data
    - xml
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 844
    functionName: networkx.readwrite.gexf.GEXFReader.add_start_end
    functionSourceFile: networkx.readwrite.gexf
    functionUses: 4
    functionsReached:
    - xml.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: subnodes.findall
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xml.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: size.get
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: thickness.get
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: parents_element.findall
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_or_edge_xml.find
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: slices_element.findall
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: s.get
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: spells_element.findall
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: obj_xml.find
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr_element.findall
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attributes_element.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attributes_element.findall
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.leda
    functionSourceFile: networkx.readwrite.leda
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41f10>
    argNames:
    - path
    - encoding
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 23
    functionName: networkx.readwrite.leda.read_leda
    functionSourceFile: networkx.readwrite.leda
    functionUses: 0
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - node.items
    - line.startswith
    - networkx.readwrite.leda.parse_leda
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - lines.split
    - <builtin>.len
    - <builtin>.next
    - line.decode
    - <builtin>.iter
    - line.rstrip
    - <builtin>.isinstance
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 50
    functionName: networkx.readwrite.leda.parse_leda
    functionSourceFile: networkx.readwrite.leda
    functionUses: 1
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - node.items
    - line.startswith
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - lines.split
    - <builtin>.len
    - <builtin>.next
    - <builtin>.iter
    - line.rstrip
    - <builtin>.isinstance
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lines.split
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.startswith
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.pajek
    functionSourceFile: networkx.readwrite.pajek
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 8
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 25
    functionName: networkx.readwrite.pajek.generate_pajek
    functionSourceFile: networkx.readwrite.pajek
    functionUses: 1
    functionsReached:
    - d.pop
    - <builtin>.zip
    - <builtin>.str
    - <builtin>.map
    - G.nodes.get
    - warnings.warn
    - <builtin>.int
    - <builtin>.len
    - edgedata.copy
    - v.strip
    - na.items
    - G.is_directed
    - G.order
    - <builtin>.list
    - d.items
    - <builtin>.isinstance
    - G.edges
    - <builtin>.range
    - na.pop
    - networkx.readwrite.pajek.make_qstr
    - <builtin>.dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.order
    functionSourceFile: <builtin>
    functionUses: 208
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.nodes.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: na.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: na.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - t
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 278
    functionName: networkx.readwrite.pajek.make_qstr
    functionSourceFile: networkx.readwrite.pajek
    functionUses: 2
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgedata.copy
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bba48e0>
    argNames:
    - G
    - path
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 100
    functionName: networkx.readwrite.pajek.write_pajek
    functionSourceFile: networkx.readwrite.pajek
    functionUses: 0
    functionsReached:
    - d.pop
    - line.encode
    - <builtin>.zip
    - <builtin>.str
    - <builtin>.map
    - G.nodes.get
    - warnings.warn
    - path.write
    - <builtin>.int
    - <builtin>.len
    - edgedata.copy
    - v.strip
    - na.items
    - G.is_directed
    - G.order
    - <builtin>.list
    - d.items
    - <builtin>.isinstance
    - G.edges
    - <builtin>.range
    - na.pop
    - networkx.readwrite.pajek.make_qstr
    - <builtin>.dict
    - networkx.readwrite.pajek.generate_pajek
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcb250>
    argNames:
    - path
    - encoding
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 134
    functionName: networkx.readwrite.pajek.read_pajek
    functionSourceFile: networkx.readwrite.pajek
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - nodelabels.get
    - line.decode
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.float
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - x.decode
    - attr.copy
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - line.rstrip
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - labels.append
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.readwrite.pajek.parse_pajek
    - line.split
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - shlex.split
    - l.split
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - lines.split
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - edge_data.update
    - d.items
    - l.lower
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 9
    IfCount: 8
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 167
    functionName: networkx.readwrite.pajek.parse_pajek
    functionSourceFile: networkx.readwrite.pajek
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - nodelabels.get
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.float
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - x.decode
    - attr.copy
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - line.rstrip
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - labels.append
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - line.split
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - shlex.split
    - l.split
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - lines.split
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - edge_data.update
    - d.items
    - l.lower
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: l.lower
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: l.split
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.decode
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: shlex.split
    functionSourceFile: shlex
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: labels.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodelabels.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: line.split
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.readwrite.text
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached:
    - networkx.utils.decorators.open_file
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - networkx.utils.decorators.argmap
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - cls
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 16
    functionName: networkx.readwrite.text.BaseGlyphs.as_dict
    functionSourceFile: networkx.readwrite.text
    functionUses: 1
    functionsReached:
    - <builtin>.getattr
    - a.startswith
    - <builtin>.dir
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.dir
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: a.startswith
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 28
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 14
    EdgeCount: 40
    ICount: 9
    IfCount: 28
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3eb0>
    - <ast.Constant object at 0x7f734d3a3430>
    - <ast.Constant object at 0x7f734d3a3f40>
    - <ast.Constant object at 0x7f734d3a30d0>
    - <ast.Constant object at 0x7f734d3a3b80>
    argNames:
    - graph
    - with_labels
    - sources
    - max_depth
    - ascii_only
    - vertical_chains
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 73
    functionName: networkx.readwrite.text.generate_network_text
    functionSourceFile: networkx.readwrite.text
    functionUses: 1
    functionsReached:
    - networkx.connected_components
    - <builtin>.sorted
    - sources.append
    - graph.is_directed
    - <builtin>.str
    - <builtin>.enumerate
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.readwrite.text._find_sources
    - typing.NamedTuple.__init__
    - stack.append
    - networkx.condensation
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - collections.defaultdict
    - <builtin>.min
    - seen_nodes.add
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.is_directed
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 610
    functionName: networkx.readwrite.text._find_sources
    functionSourceFile: networkx.readwrite.text
    functionUses: 2
    functionsReached:
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.condensation
    - sources.append
    - <builtin>.min
    - <builtin>.list
    - <builtin>.iter
    - graph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.readwrite.text.generate_network_text.<lambda1>
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: stack.pop
    functionSourceFile: <builtin>
    functionUses: 237
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: stack.append
    functionSourceFile: <builtin>
    functionUses: 266
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen_nodes.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06a30>
    - <ast.Constant object at 0x7f734bc06c40>
    - <ast.Constant object at 0x7f734bc06340>
    - <ast.Constant object at 0x7f734bc068b0>
    - <ast.Constant object at 0x7f734bc06cd0>
    - <ast.Constant object at 0x7f734bc06400>
    - <ast.Constant object at 0x7f734bc06b20>
    argNames:
    - graph
    - path
    - with_labels
    - sources
    - max_depth
    - ascii_only
    - end
    - vertical_chains
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 423
    functionName: networkx.readwrite.text.write_network_text
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached:
    - networkx.connected_components
    - <builtin>.sorted
    - sys.stdout.write
    - sources.append
    - graph.is_directed
    - <builtin>.str
    - <builtin>.enumerate
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.readwrite.text.generate_network_text
    - networkx.readwrite.text._find_sources
    - typing.NamedTuple.__init__
    - stack.append
    - <builtin>.hasattr
    - networkx.condensation
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.callable
    - <builtin>.isinstance
    - collections.defaultdict
    - <builtin>.min
    - seen_nodes.add
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sys.stdout.write
    functionSourceFile: sys
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.strongly_connected_components
    functionSourceFile: ''
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.condensation
    functionSourceFile: ''
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.readwrite.text._find_sources.<lambda1>
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sources.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.readwrite.text._find_sources.<lambda2>
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.readwrite.text._find_sources.<lambda3>
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 15
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 22
    ICount: 16
    IfCount: 15
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 647
    functionName: networkx.readwrite.text._parse_network_text
    functionSourceFile: networkx.readwrite.text
    functionUses: 0
    functionsReached:
    - edges.extend
    - itertools.chain.rsplit
    - initial_lines.append
    - unambiguous_undirected_items.append
    - directed_glyphs.values
    - <builtin>.dir
    - new.add_nodes_from
    - <builtin>.any
    - nodes.append
    - backedge_part.split
    - edges.append
    - stack.pop
    - itertools.chain.split
    - <builtin>.len
    - node.strip
    - <builtin>.set
    - <builtin>.object
    - a.startswith
    - <builtin>.next
    - node_part.rstrip
    - itertools.chain
    - typing.NamedTuple.__init__
    - stack.append
    - u.strip
    - <builtin>.iter
    - new.add_edges_from
    - networkx.readwrite.text.BaseGlyphs.as_dict
    - undirected_glyphs.values
    - <builtin>.getattr
    - unambiguous_directed_items.append
    - node_part.rsplit
    linkageType: pythonLinkage
    raised:
    - AssertionError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: initial_lines.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: directed_glyphs.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: undirected_glyphs.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unambiguous_directed_items.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unambiguous_undirected_items.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.object
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.chain.split
    functionSourceFile: itertools
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backedge_part.split
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_part.rstrip
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_part.rsplit
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node.strip
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.chain.rsplit
    functionSourceFile: itertools
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new.add_nodes_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6e1f0>
    - <ast.Constant object at 0x7f734cc6e070>
    argNames:
    - G
    - delimiter
    - data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 43
    functionName: networkx.readwrite.edgelist.generate_edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 2
    functionsReached:
    - delimiter.join
    - <builtin>.dict
    - e.extend
    - <builtin>.map
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.extend
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e0d0>
    - <ast.Constant object at 0x7f734a65e8e0>
    - <ast.Constant object at 0x7f734a65edf0>
    - <ast.Constant object at 0x7f734a65e370>
    argNames:
    - G
    - path
    - comments
    - delimiter
    - data
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 127
    functionName: networkx.readwrite.edgelist.write_edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 1
    functionsReached:
    - delimiter.join
    - line.encode
    - path.write
    - networkx.readwrite.edgelist.generate_edgelist
    - <builtin>.dict
    - e.extend
    - <builtin>.map
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 3
    IfCount: 9
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a83a0>
    - <ast.Constant object at 0x7f734b6a81c0>
    - <ast.Constant object at 0x7f734b6a84c0>
    - <ast.Constant object at 0x7f734b6a8910>
    - <ast.Constant object at 0x7f734b6a8100>
    argNames:
    - lines
    - comments
    - delimiter
    - create_using
    - nodetype
    - data
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 177
    functionName: networkx.readwrite.edgelist.parse_edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 2
    functionsReached:
    - ast.literal_eval
    - edgedata.update
    - datadict.update
    - <builtin>.zip
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - s.pop
    - networkx._clear_cache
    - edgedata_str.strip
    - keydict.get
    - line.rstrip
    - <builtin>.len
    - <builtin>.dict
    - line.find
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - TypeError
    - IndexError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: s.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgedata_str.strip
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgedata.update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc8be0>
    - <ast.Constant object at 0x7f734cfc8f70>
    - <ast.Constant object at 0x7f734cfc8190>
    - <ast.Constant object at 0x7f734cbd0e80>
    - <ast.Constant object at 0x7f734cbd09a0>
    - <ast.Constant object at 0x7f734cbd0f70>
    - <ast.Constant object at 0x7f734cbd0cd0>
    argNames:
    - path
    - comments
    - delimiter
    - create_using
    - nodetype
    - data
    - edgetype
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 302
    functionName: networkx.readwrite.edgelist.read_edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 1
    functionsReached:
    - edgedata.update
    - <builtin>.zip
    - s.pop
    - keydict.get
    - networkx.readwrite.edgelist.parse_edgelist
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - edgedata_str.strip
    - <builtin>.len
    - ast.literal_eval
    - line.decode
    - line.rstrip
    - line.find
    - <builtin>.isinstance
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8f10>
    - <ast.Constant object at 0x7f734cbe8130>
    - <ast.Constant object at 0x7f734cbe8340>
    argNames:
    - G
    - path
    - comments
    - delimiter
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 388
    functionName: networkx.readwrite.edgelist.write_weighted_edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 0
    functionsReached:
    - delimiter.join
    - line.encode
    - path.write
    - networkx.readwrite.edgelist.generate_edgelist
    - <builtin>.dict
    - e.extend
    - <builtin>.map
    - networkx.readwrite.edgelist.write_edgelist
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9dc70>
    - <ast.Constant object at 0x7f734cf9d580>
    - <ast.Constant object at 0x7f734cf9d2e0>
    - <ast.Constant object at 0x7f734cf9df10>
    - <ast.Constant object at 0x7f734cf9d250>
    argNames:
    - path
    - comments
    - delimiter
    - create_using
    - nodetype
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 429
    functionName: networkx.readwrite.edgelist.read_weighted_edgelist
    functionSourceFile: networkx.readwrite.edgelist
    functionUses: 0
    functionsReached:
    - edgedata.update
    - <builtin>.zip
    - s.pop
    - keydict.get
    - networkx.readwrite.edgelist.parse_edgelist
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - edgedata_str.strip
    - <builtin>.len
    - ast.literal_eval
    - line.decode
    - line.rstrip
    - line.find
    - <builtin>.isinstance
    - networkx.readwrite.edgelist.read_edgelist
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.multiline_adjlist
    functionSourceFile: networkx.readwrite.multiline_adjlist
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 15
    IfCount: 7
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16a30>
    argNames:
    - G
    - delimiter
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 39
    functionName: networkx.readwrite.multiline_adjlist.generate_multiline_adjlist
    functionSourceFile: networkx.readwrite.multiline_adjlist
    functionUses: 1
    functionsReached:
    - G.is_directed
    - nbrs.items
    - <builtin>.len
    - <builtin>.set
    - G.is_multigraph
    - <builtin>.str
    - datadict.items
    - G.adjacency
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: datadict.items
    functionSourceFile: <builtin>
    functionUses: 295
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc7a60>
    - <ast.Constant object at 0x7f734cfc7640>
    - <ast.Constant object at 0x7f734cfc7850>
    argNames:
    - G
    - path
    - delimiter
    - comments
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 137
    functionName: networkx.readwrite.multiline_adjlist.write_multiline_adjlist
    functionSourceFile: networkx.readwrite.multiline_adjlist
    functionUses: 0
    functionsReached:
    - G.is_directed
    - time.asctime
    - networkx.readwrite.multiline_adjlist.generate_multiline_adjlist
    - path.write
    - nbrs.items
    - datadict.items
    - <builtin>.len
    - multiline.encode
    - <builtin>.set
    - time.gmtime
    - G.is_multigraph
    - <builtin>.str
    - header.encode
    - G.adjacency
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: multiline.encode
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 3
    IfCount: 8
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd27a60>
    - <ast.Constant object at 0x7f734cd27fa0>
    - <ast.Constant object at 0x7f734cd271f0>
    - <ast.Constant object at 0x7f734cd277c0>
    - <ast.Constant object at 0x7f734cd27a30>
    argNames:
    - lines
    - comments
    - delimiter
    - create_using
    - nodetype
    - edgetype
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 195
    functionName: networkx.readwrite.multiline_adjlist.parse_multiline_adjlist
    functionSourceFile: networkx.readwrite.multiline_adjlist
    functionUses: 1
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - vlist.pop
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.next
    - attr_dict.update
    - ast.literal_eval
    - line.rstrip
    - line.find
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8580>
    - <ast.Constant object at 0x7f734aaa8310>
    - <ast.Constant object at 0x7f734aaa8be0>
    - <ast.Constant object at 0x7f734aaa83d0>
    - <ast.Constant object at 0x7f734aaa8100>
    - <ast.Constant object at 0x7f734aaa82b0>
    argNames:
    - path
    - comments
    - delimiter
    - create_using
    - nodetype
    - edgetype
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 305
    functionName: networkx.readwrite.multiline_adjlist.read_multiline_adjlist
    functionSourceFile: networkx.readwrite.multiline_adjlist
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - vlist.pop
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.next
    - attr_dict.update
    - ast.literal_eval
    - line.decode
    - line.rstrip
    - line.find
    - <builtin>.range
    - networkx.readwrite.multiline_adjlist.parse_multiline_adjlist
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes
    functionSourceFile: networkx.classes
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.digraph
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - obj
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 41
    functionName: networkx.classes.digraph._CachedPropertyResetterAdjAndSucc.__set__
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - obj
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 78
    functionName: networkx.classes.digraph._CachedPropertyResetterPred.__set__
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.classes.digraph.DiGraph
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - functools.cached_property
    - networkx.has_path
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfed00>
    argNames:
    - cls
    - incoming_graph_data
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 341
    functionName: networkx.classes.digraph.DiGraph.__new__
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - object.__new__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd48c70>
    argNames:
    - self
    - incoming_graph_data
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 344
    functionName: networkx.classes.digraph.DiGraph.__init__
    functionSourceFile: networkx.classes.digraph
    functionUses: 65
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - keydict.get
    - attr.copy
    - networkx.from_numpy_array
    - <builtin>.str
    - newdict.update
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 3
    IfCount: 10
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c426b50>
    - <ast.Constant object at 0x7f734c4261f0>
    argNames:
    - data
    - create_using
    - multigraph_input
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 34
    functionName: networkx.convert.to_networkx_graph
    functionSourceFile: networkx.convert
    functionUses: 291
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.from_numpy_array
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - d.items
    - networkx.empty_graph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr.pop
    functionSourceFile: <builtin>
    functionUses: 291
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: functools.cached_property
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 395
    functionName: networkx.classes.digraph.DiGraph.adj
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - d
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 44
    functionName: networkx.classes.coreviews.AtlasView.__init__
    functionSourceFile: ''
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 414
    functionName: networkx.classes.digraph.DiGraph.succ
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 435
    functionName: networkx.classes.digraph.DiGraph.pred
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr_dict.update
    functionSourceFile: <builtin>
    functionUses: 364
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx._clear_cache
    functionSourceFile: ''
    functionUses: 626
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 455
    functionName: networkx.classes.graph.Graph.__iter__
    functionSourceFile: networkx.classes.graph
    functionUses: 512
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr.copy
    functionSourceFile: <builtin>
    functionUses: 421
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: newdict.update
    functionSourceFile: <builtin>
    functionUses: 421
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 579
    functionName: networkx.classes.digraph.DiGraph.remove_node
    functionSourceFile: networkx.classes.digraph
    functionUses: 220
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 622
    functionName: networkx.classes.digraph.DiGraph.remove_nodes_from
    functionSourceFile: networkx.classes.digraph
    functionUses: 4
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - u_of_edge
    - v_of_edge
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 677
    functionName: networkx.classes.digraph.DiGraph.add_edge
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - datadict.update
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 213
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    functionSourceFile: ''
    functionUses: 549
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: datadict.update
    functionSourceFile: <builtin>
    functionUses: 549
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - ebunch_to_add
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 748
    functionName: networkx.classes.digraph.DiGraph.add_edges_from
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - datadict.update
    linkageType: pythonLinkage
    raised:
    - ValueError
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 831
    functionName: networkx.classes.digraph.DiGraph.remove_edge
    functionSourceFile: networkx.classes.digraph
    functionUses: 223
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 865
    functionName: networkx.classes.digraph.DiGraph.remove_edges_from
    functionSourceFile: networkx.classes.digraph
    functionUses: 203
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 898
    functionName: networkx.classes.digraph.DiGraph.has_successor
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 905
    functionName: networkx.classes.digraph.DiGraph.has_predecessor
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 912
    functionName: networkx.classes.digraph.DiGraph.successors
    functionSourceFile: networkx.classes.digraph
    functionUses: 223
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 944
    functionName: networkx.classes.digraph.DiGraph.predecessors
    functionSourceFile: networkx.classes.digraph
    functionUses: 206
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 970
    functionName: networkx.classes.digraph.DiGraph.edges
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1067
    functionName: networkx.classes.reportviews.OutEdgeView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 400
    functionsReached:
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1034
    functionName: networkx.classes.digraph.DiGraph.out_edges
    functionSourceFile: networkx.classes.digraph
    functionUses: 198
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1040
    functionName: networkx.classes.digraph.DiGraph.in_edges
    functionSourceFile: networkx.classes.digraph
    functionUses: 207
    functionsReached:
    - networkx.classes.reportviews.InEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1303
    functionName: networkx.classes.reportviews.InEdgeView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 208
    functionsReached:
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1080
    functionName: networkx.classes.digraph.DiGraph.degree
    functionSourceFile: networkx.classes.digraph
    functionUses: 247
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b691970>
    - <ast.Constant object at 0x7f734b691220>
    argNames:
    - self
    - G
    - nbunch
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 421
    functionName: networkx.classes.reportviews.DiDegreeView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 271
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1124
    functionName: networkx.classes.digraph.DiGraph.in_degree
    functionSourceFile: networkx.classes.digraph
    functionUses: 205
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1171
    functionName: networkx.classes.digraph.DiGraph.out_degree
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 6
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1217
    functionName: networkx.classes.digraph.DiGraph.clear
    functionSourceFile: networkx.classes.digraph
    functionUses: 48
    functionsReached:
    - collections.abc.Mapping.clear
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.clear
    functionSourceFile: collections
    functionUses: 50
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1238
    functionName: networkx.classes.digraph.DiGraph.clear_edges
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - predecessor_dict.clear
    - networkx._clear_cache
    - successor_dict.clear
    - collections.abc.Mapping.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.values
    functionSourceFile: collections
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: predecessor_dict.clear
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: successor_dict.clear
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1257
    functionName: networkx.classes.digraph.DiGraph.is_multigraph
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734caee340>
    - <ast.Constant object at 0x7f734caee670>
    argNames:
    - self
    - reciprocal
    - as_view
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1265
    functionName: networkx.classes.digraph.DiGraph.to_undirected
    functionSourceFile: networkx.classes.digraph
    functionUses: 0
    functionsReached:
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - keylist.append
    - <builtin>.str
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - datadict.items
    - attr.pop
    - <builtin>.iter
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - networkx.empty_graph
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 302
    functionName: networkx.classes.multigraph.MultiGraph.to_undirected_class
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d611280>
    argNames:
    - G
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 42
    functionName: networkx.classes.graphviews.generic_graph_view
    functionSourceFile: networkx.classes.graphviews
    functionUses: 238
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.freeze
    - collections.abc.Mapping.keys
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d612a90>
    argNames:
    - self
    - incoming_graph_data
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 349
    functionName: networkx.classes.graph.Graph.__init__
    functionSourceFile: networkx.classes.graph
    functionUses: 272
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - keydict.get
    - attr.copy
    - networkx.from_numpy_array
    - <builtin>.str
    - newdict.update
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 7
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc900d0>
    - <ast.Constant object at 0x7f734bc904c0>
    argNames:
    - self
    - incoming_graph_data
    - multigraph_input
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 320
    functionName: networkx.classes.multigraph.MultiGraph.__init__
    functionSourceFile: networkx.classes.multigraph
    functionUses: 244
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.add_nodes_from
    functionSourceFile: <builtin>
    functionUses: 238
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.items
    functionSourceFile: collections
    functionUses: 240
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 240
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8430>
    argNames:
    - self
    - copy
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1344
    functionName: networkx.classes.digraph.DiGraph.reverse
    functionSourceFile: networkx.classes.digraph
    functionUses: 196
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - networkx.reverse_view
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - H.add_edges_from
    - H.add_nodes_from
    - H.graph.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.graph.update
    functionSourceFile: <builtin>
    functionUses: 204
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.add_nodes_from
    functionSourceFile: <builtin>
    functionUses: 212
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 213
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.reverse_view
    functionSourceFile: ''
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 174
    functionName: networkx.classes.reportviews.NodeView.__getstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 177
    functionName: networkx.classes.reportviews.NodeView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 180
    functionName: networkx.classes.reportviews.NodeView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 335
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 184
    functionName: networkx.classes.reportviews.NodeView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 190
    functionName: networkx.classes.reportviews.NodeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 199
    functionName: networkx.classes.reportviews.NodeView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - it
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 203
    functionName: networkx.classes.reportviews.NodeView._from_iterable
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73439b3250>
    - <ast.Constant object at 0x7f73439b3220>
    argNames:
    - self
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 207
    functionName: networkx.classes.reportviews.NodeView.__call__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.NodeDataView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41040>
    - <ast.Constant object at 0x7f734cd41df0>
    argNames:
    - self
    - nodedict
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 315
    functionName: networkx.classes.reportviews.NodeDataView.__init__
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448430>
    - <ast.Constant object at 0x7f734c4486a0>
    argNames:
    - self
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 212
    functionName: networkx.classes.reportviews.NodeView.data
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.NodeDataView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 280
    functionName: networkx.classes.reportviews.NodeView.__str__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 283
    functionName: networkx.classes.reportviews.NodeView.__repr__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 307
    functionName: networkx.classes.reportviews.NodeDataView.__getstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 310
    functionName: networkx.classes.reportviews.NodeDataView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - it
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 321
    functionName: networkx.classes.reportviews.NodeDataView._from_iterable
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.set
    - <builtin>.str
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 330
    functionName: networkx.classes.reportviews.NodeDataView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 333
    functionName: networkx.classes.reportviews.NodeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 344
    functionName: networkx.classes.reportviews.NodeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 358
    functionName: networkx.classes.reportviews.NodeDataView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 370
    functionName: networkx.classes.reportviews.NodeDataView.__str__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 373
    functionName: networkx.classes.reportviews.NodeDataView.__repr__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.dict
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24c10>
    argNames:
    - self
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 2013
    functionName: networkx.classes.graph.Graph.nbunch_iter
    functionSourceFile: networkx.classes.graph
    functionUses: 295
    functionsReached:
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 0
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24520>
    - <ast.Constant object at 0x7f734cd24fa0>
    argNames:
    - self
    - nbunch
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 428
    functionName: networkx.classes.reportviews.DiDegreeView.__call__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 442
    functionName: networkx.classes.reportviews.DiDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - dd.get
    - <builtin>.sum
    - succs.values
    - <builtin>.len
    - preds.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: succs.values
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: preds.values
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 452
    functionName: networkx.classes.reportviews.DiDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - dd.get
    - <builtin>.sum
    - succs.values
    - <builtin>.len
    - preds.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 468
    functionName: networkx.classes.reportviews.DiDegreeView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 471
    functionName: networkx.classes.reportviews.DiDegreeView.__str__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 474
    functionName: networkx.classes.reportviews.DiDegreeView.__repr__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 522
    functionName: networkx.classes.reportviews.DegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - nbrs.values
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrs.values
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 531
    functionName: networkx.classes.reportviews.DegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - nbrs.values
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 549
    functionName: networkx.classes.reportviews.OutDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - nbrs.values
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 556
    functionName: networkx.classes.reportviews.OutDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - succs.values
    - <builtin>.len
    - dd.get
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 572
    functionName: networkx.classes.reportviews.InDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - nbrs.values
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 579
    functionName: networkx.classes.reportviews.InDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - dd.get
    - <builtin>.sum
    - preds.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 595
    functionName: networkx.classes.reportviews.MultiDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - d.get
    - key_dict.values
    - nbrs.values
    - <builtin>.sum
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: key_dict.values
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 610
    functionName: networkx.classes.reportviews.MultiDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - d.get
    - key_dict.values
    - nbrs.values
    - <builtin>.sum
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 635
    functionName: networkx.classes.reportviews.DiMultiDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - key_dict.values
    - d.get
    - <builtin>.sum
    - succs.values
    - <builtin>.len
    - preds.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 651
    functionName: networkx.classes.reportviews.DiMultiDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - key_dict.values
    - d.get
    - <builtin>.sum
    - succs.values
    - <builtin>.len
    - preds.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 680
    functionName: networkx.classes.reportviews.InMultiDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - d.get
    - key_dict.values
    - nbrs.values
    - <builtin>.sum
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 690
    functionName: networkx.classes.reportviews.InMultiDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - d.get
    - key_dict.values
    - nbrs.values
    - <builtin>.sum
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 711
    functionName: networkx.classes.reportviews.OutMultiDegreeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - d.get
    - key_dict.values
    - nbrs.values
    - <builtin>.sum
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 721
    functionName: networkx.classes.reportviews.OutMultiDegreeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - d.get
    - key_dict.values
    - nbrs.values
    - <builtin>.sum
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 760
    functionName: networkx.classes.reportviews.OutEdgeDataView.__getstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 768
    functionName: networkx.classes.reportviews.OutEdgeDataView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.reportviews.OutEdgeDataView.__init__
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a85e0>
    - <ast.Constant object at 0x7f734b6a8d90>
    argNames:
    - self
    - viewer
    - nbunch
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 771
    functionName: networkx.classes.reportviews.OutEdgeDataView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 3
    functionsReached:
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda1>
    functionSourceFile: networkx.classes.reportviews
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    functionSourceFile: networkx.classes.reportviews
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    functionSourceFile: networkx.classes.reportviews
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    functionSourceFile: networkx.classes.reportviews
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 795
    functionName: networkx.classes.reportviews.OutEdgeDataView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    functionSourceFile: ''
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 798
    functionName: networkx.classes.reportviews.OutEdgeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - nbrs.items
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 805
    functionName: networkx.classes.reportviews.OutEdgeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 815
    functionName: networkx.classes.reportviews.OutEdgeDataView.__str__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 818
    functionName: networkx.classes.reportviews.OutEdgeDataView.__repr__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 853
    functionName: networkx.classes.reportviews.EdgeDataView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 856
    functionName: networkx.classes.reportviews.EdgeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    - nbrs.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 865
    functionName: networkx.classes.reportviews.EdgeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 881
    functionName: networkx.classes.reportviews.InEdgeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - nbrs.items
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 888
    functionName: networkx.classes.reportviews.InEdgeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda3>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 904
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__getstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 913
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 0
    IfCount: 6
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734397de80>
    - <ast.Constant object at 0x7f734397de50>
    argNames:
    - self
    - viewer
    - nbunch
    - data
    - default
    - keys
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 916
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 5
    functionsReached:
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 954
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 957
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kd.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - nbrs.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kd.items
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 965
    functionName: networkx.classes.reportviews.OutMultiEdgeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kdict.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - <builtin>.any
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kdict.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 988
    functionName: networkx.classes.reportviews.MultiEdgeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kd.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - nbrs.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 998
    functionName: networkx.classes.reportviews.MultiEdgeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kdict.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - <builtin>.any
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1024
    functionName: networkx.classes.reportviews.InMultiEdgeDataView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kd.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda1>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - nbrs.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1032
    functionName: networkx.classes.reportviews.InMultiEdgeDataView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kdict.items
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda6>
    - <builtin>.any
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda4>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda2>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda5>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda7>
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__.<lambda3>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1053
    functionName: networkx.classes.reportviews.OutEdgeView.__getstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1056
    functionName: networkx.classes.reportviews.OutEdgeView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - cls
    - it
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1062
    functionName: networkx.classes.reportviews.OutEdgeView._from_iterable
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1073
    functionName: networkx.classes.reportviews.OutEdgeView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1076
    functionName: networkx.classes.reportviews.OutEdgeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1081
    functionName: networkx.classes.reportviews.OutEdgeView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1089
    functionName: networkx.classes.reportviews.OutEdgeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73439aeeb0>
    - <ast.Constant object at 0x7f73439aee80>
    argNames:
    - self
    - nbunch
    - data
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1102
    functionName: networkx.classes.reportviews.OutEdgeView.__call__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.reportviews.OutEdgeDataView.__init__
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73439ae940>
    - <ast.Constant object at 0x7f73439ae910>
    - <ast.Constant object at 0x7f73439ae8e0>
    argNames:
    - self
    - data
    - default
    - nbunch
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1107
    functionName: networkx.classes.reportviews.OutEdgeView.data
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.reportviews.OutEdgeDataView.__init__
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1188
    functionName: networkx.classes.reportviews.OutEdgeView.__str__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1191
    functionName: networkx.classes.reportviews.OutEdgeView.__repr__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1270
    functionName: networkx.classes.reportviews.EdgeView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1274
    functionName: networkx.classes.reportviews.EdgeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1283
    functionName: networkx.classes.reportviews.EdgeView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1296
    functionName: networkx.classes.reportviews.InEdgeView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1308
    functionName: networkx.classes.reportviews.InEdgeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1313
    functionName: networkx.classes.reportviews.InEdgeView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1320
    functionName: networkx.classes.reportviews.InEdgeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1337
    functionName: networkx.classes.reportviews.OutMultiEdgeView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    - nbrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1348
    functionName: networkx.classes.reportviews.OutMultiEdgeView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1362
    functionName: networkx.classes.reportviews.OutMultiEdgeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7349eae400>
    - <ast.Constant object at 0x7f7349eae430>
    argNames:
    - self
    - nbunch
    - data
    - default
    - keys
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1371
    functionName: networkx.classes.reportviews.OutMultiEdgeView.__call__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7349eaeac0>
    - <ast.Constant object at 0x7f7349eaeaf0>
    - <ast.Constant object at 0x7f7349eaeb20>
    - <ast.Constant object at 0x7f7349eaeb50>
    argNames:
    - self
    - data
    - default
    - nbunch
    - keys
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1376
    functionName: networkx.classes.reportviews.OutMultiEdgeView.data
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeDataView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1389
    functionName: networkx.classes.reportviews.MultiEdgeView.__len__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1392
    functionName: networkx.classes.reportviews.MultiEdgeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - kd.items
    - nbrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1408
    functionName: networkx.classes.reportviews.InMultiEdgeView.__setstate__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1415
    functionName: networkx.classes.reportviews.InMultiEdgeView.__init__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 214
    functionsReached:
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1420
    functionName: networkx.classes.reportviews.InMultiEdgeView.__iter__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 201
    functionsReached:
    - nbrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1426
    functionName: networkx.classes.reportviews.InMultiEdgeView.__contains__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1440
    functionName: networkx.classes.reportviews.InMultiEdgeView.__getitem__
    functionSourceFile: networkx.classes.reportviews
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.graph
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - obj
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 38
    functionName: networkx.classes.graph._CachedPropertyResetterAdj.__set__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - obj
    - value
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 63
    functionName: networkx.classes.graph._CachedPropertyResetterNode.__set__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 323
    functionName: networkx.classes.graph.Graph.to_directed_class
    functionSourceFile: networkx.classes.graph
    functionUses: 15
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 331
    functionName: networkx.classes.graph.Graph.to_undirected_class
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.classes.graph.Graph
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - functools.cached_property
    - networkx.has_path
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb32820>
    argNames:
    - cls
    - incoming_graph_data
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 346
    functionName: networkx.classes.graph.Graph.__new__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - object.__new__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 394
    functionName: networkx.classes.graph.Graph.adj
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - s
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 423
    functionName: networkx.classes.graph.Graph.name
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 427
    functionName: networkx.classes.graph.Graph.__str__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 473
    functionName: networkx.classes.graph.Graph.__contains__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 487
    functionName: networkx.classes.graph.Graph.__len__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 509
    functionName: networkx.classes.graph.Graph.__getitem__
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - nodes_for_adding
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 584
    functionName: networkx.classes.graph.Graph.add_nodes_from
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - newdict.update
    - networkx._clear_cache
    - attr.copy
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 662
    functionName: networkx.classes.graph.Graph.remove_node
    functionSourceFile: networkx.classes.graph
    functionUses: 211
    functionsReached:
    - networkx._clear_cache
    - <builtin>.list
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 703
    functionName: networkx.classes.graph.Graph.remove_nodes_from
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx._clear_cache
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 849
    functionName: networkx.classes.graph.Graph.number_of_nodes
    functionSourceFile: networkx.classes.graph
    functionUses: 206
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 870
    functionName: networkx.classes.graph.Graph.order
    functionSourceFile: networkx.classes.graph
    functionUses: 201
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 891
    functionName: networkx.classes.graph.Graph.has_node
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - u_of_edge
    - v_of_edge
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 917
    functionName: networkx.classes.graph.Graph.add_edge
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - datadict.update
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - ebunch_to_add
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 986
    functionName: networkx.classes.graph.Graph.add_edges_from
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - datadict.update
    linkageType: pythonLinkage
    raised:
    - ValueError
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6ed90>
    argNames:
    - self
    - ebunch_to_add
    - weight
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1067
    functionName: networkx.classes.graph.Graph.add_weighted_edges_from
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1118
    functionName: networkx.classes.graph.Graph.remove_edge
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1152
    functionName: networkx.classes.graph.Graph.remove_edges_from
    functionSourceFile: networkx.classes.graph
    functionUses: 197
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 8
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d640670>
    - <ast.Constant object at 0x7f734d640250>
    argNames:
    - self
    - edges
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1187
    functionName: networkx.classes.graph.Graph.update
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - graph_nodes.data
    - keydict.get
    - attr.copy
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.iter
    - graph_edges.data
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_nodes.data
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_edges.data
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1344
    functionName: networkx.classes.graph.Graph.neighbors
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1388
    functionName: networkx.classes.graph.Graph.edges
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7ee20>
    argNames:
    - self
    - u
    - v
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1444
    functionName: networkx.classes.graph.Graph.get_edge_data
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1490
    functionName: networkx.classes.graph.Graph.adjacency
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - collections.abc.Mapping.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1511
    functionName: networkx.classes.graph.Graph.degree
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1548
    functionName: networkx.classes.graph.Graph.clear
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.clear
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1568
    functionName: networkx.classes.graph.Graph.clear_edges
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.values
    - nbr_dict.clear
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbr_dict.clear
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1584
    functionName: networkx.classes.graph.Graph.is_multigraph
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734caee370>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1592
    functionName: networkx.classes.graph.Graph.copy
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - datadict.copy
    - networkx.freeze
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.abc.Mapping.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: datadict.copy
    functionSourceFile: <builtin>
    functionUses: 217
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 294
    functionName: networkx.classes.multigraph.MultiGraph.to_directed_class
    functionSourceFile: ''
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 7
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfe250>
    - <ast.Constant object at 0x7f734cbfeaf0>
    argNames:
    - self
    - incoming_graph_data
    - multigraph_input
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 312
    functionName: networkx.classes.multidigraph.MultiDiGraph.__init__
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 63
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - d.items
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16760>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1737
    functionName: networkx.classes.graph.Graph.to_undirected
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - keylist.append
    - <builtin>.str
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - datadict.items
    - attr.pop
    - <builtin>.iter
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - networkx.empty_graph
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 67
    functionName: networkx.classes.filters.show_nodes.__init__
    functionSourceFile: networkx.classes.filters
    functionUses: 228
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - filter_node
    - filter_edge
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 136
    functionName: networkx.classes.graphviews.subgraph_view
    functionSourceFile: networkx.classes.graphviews
    functionUses: 215
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.freeze
    - G.__class__
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - edges
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1878
    functionName: networkx.classes.graph.Graph.edge_subgraph
    functionSourceFile: networkx.classes.graph
    functionUses: 0
    functionsReached:
    - networkx.edge_subgraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.edge_subgraph
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67f3d0>
    argNames:
    - self
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 1918
    functionName: networkx.classes.graph.Graph.size
    functionSourceFile: networkx.classes.graph
    functionUses: 224
    functionsReached:
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.iter
    - <builtin>.sum
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 987
    functionName: networkx.classes.multigraph.MultiGraph.degree
    functionSourceFile: networkx.classes.multigraph
    functionUses: 248
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 316
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 247
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 724
    functionName: networkx.classes.multidigraph.MultiDiGraph.degree
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 248
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0fa30>
    - <ast.Constant object at 0x7f734cd0f040>
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1961
    functionName: networkx.classes.graph.Graph.number_of_edges
    functionSourceFile: networkx.classes.graph
    functionUses: 199
    functionsReached:
    - networkx.classes.graph.Graph.size
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.int
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.iter
    - <builtin>.sum
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - nlist
    - adj
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 2059
    functionName: networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    functionSourceFile: networkx.classes.graph
    functionUses: 296
    functionsReached:
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.convert
    functionSourceFile: networkx.convert
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 12
    IfCount: 8
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb550d0>
    - <ast.Constant object at 0x7f734bb555e0>
    argNames:
    - d
    - create_using
    - multigraph_input
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 374
    functionName: networkx.convert.from_dict_of_dicts
    functionSourceFile: networkx.convert
    functionUses: 292
    functionsReached:
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - keylist.append
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: result.graph.update
    functionSourceFile: <builtin>
    functionUses: 292
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc98e80>
    argNames:
    - d
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 213
    functionName: networkx.convert.from_dict_of_lists
    functionSourceFile: networkx.convert
    functionUses: 292
    functionsReached:
    - keydict.get
    - attr.copy
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - d.items
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bac86a0>
    argNames:
    - edgelist
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 479
    functionName: networkx.convert.from_edgelist
    functionSourceFile: networkx.convert
    functionUses: 292
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.from_pandas_adjacency
    functionSourceFile: ''
    functionUses: 292
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.from_pandas_edgelist
    functionSourceFile: ''
    functionUses: 292
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.from_numpy_array
    functionSourceFile: ''
    functionUses: 293
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.from_scipy_sparse_array
    functionSourceFile: ''
    functionUses: 292
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.neighbors
    functionSourceFile: <builtin>
    functionUses: 239
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c44f0>
    - <ast.Constant object at 0x7f734b5c4100>
    argNames:
    - G
    - nodelist
    - edge_data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 253
    functionName: networkx.convert.to_dict_of_dicts
    functionSourceFile: networkx.convert
    functionUses: 0
    functionsReached:
    - dod.fromkeys
    - G.adjacency
    - nbrdict.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrdict.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dod.fromkeys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67fe80>
    argNames:
    - G
    - nodelist
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 461
    functionName: networkx.convert.to_edgelist
    functionSourceFile: networkx.convert
    functionUses: 0
    functionsReached:
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.coreviews
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 38
    functionName: networkx.classes.coreviews.AtlasView.__getstate__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 41
    functionName: networkx.classes.coreviews.AtlasView.__setstate__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 47
    functionName: networkx.classes.coreviews.AtlasView.__len__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 50
    functionName: networkx.classes.coreviews.AtlasView.__iter__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 53
    functionName: networkx.classes.coreviews.AtlasView.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 56
    functionName: networkx.classes.coreviews.AtlasView.copy
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 59
    functionName: networkx.classes.coreviews.AtlasView.__str__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 62
    functionName: networkx.classes.coreviews.AtlasView.__repr__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 81
    functionName: networkx.classes.coreviews.AdjacencyView.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 84
    functionName: networkx.classes.coreviews.AdjacencyView.copy
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 103
    functionName: networkx.classes.coreviews.MultiAdjacencyView.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 106
    functionName: networkx.classes.coreviews.MultiAdjacencyView.copy
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 126
    functionName: networkx.classes.coreviews.UnionAtlas.__getstate__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 129
    functionName: networkx.classes.coreviews.UnionAtlas.__setstate__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - succ
    - pred
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 133
    functionName: networkx.classes.coreviews.UnionAtlas.__init__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 137
    functionName: networkx.classes.coreviews.UnionAtlas.__len__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 140
    functionName: networkx.classes.coreviews.UnionAtlas.__iter__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 143
    functionName: networkx.classes.coreviews.UnionAtlas.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 149
    functionName: networkx.classes.coreviews.UnionAtlas.copy
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - dd.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dd.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 158
    functionName: networkx.classes.coreviews.UnionAtlas.__str__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 161
    functionName: networkx.classes.coreviews.UnionAtlas.__repr__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 185
    functionName: networkx.classes.coreviews.UnionAdjacency.__getstate__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 188
    functionName: networkx.classes.coreviews.UnionAdjacency.__setstate__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - succ
    - pred
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 192
    functionName: networkx.classes.coreviews.UnionAdjacency.__init__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 239
    functionsReached:
    - collections.abc.Mapping.keys
    - <builtin>.set
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.keys
    functionSourceFile: collections
    functionUses: 241
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 198
    functionName: networkx.classes.coreviews.UnionAdjacency.__len__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 201
    functionName: networkx.classes.coreviews.UnionAdjacency.__iter__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 1
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nbr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 204
    functionName: networkx.classes.coreviews.UnionAdjacency.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.UnionAtlas.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 207
    functionName: networkx.classes.coreviews.UnionAdjacency.copy
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 210
    functionName: networkx.classes.coreviews.UnionAdjacency.__str__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 213
    functionName: networkx.classes.coreviews.UnionAdjacency.__repr__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 234
    functionName: networkx.classes.coreviews.UnionMultiInner.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.UnionAtlas.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 243
    functionName: networkx.classes.coreviews.UnionMultiInner.copy
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 263
    functionName: networkx.classes.coreviews.UnionMultiAdjacency.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.UnionAtlas.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - d
    - NODE_OK
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 280
    functionName: networkx.classes.coreviews.FilterAtlas.__init__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 218
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 284
    functionName: networkx.classes.coreviews.FilterAtlas.__len__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - <builtin>.hasattr
    - networkx.classes.coreviews.FilterAdjacency.__getitem__.new_node_ok
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.no_filter
    - <builtin>.sum
    - <builtin>.len
    - networkx.classes.coreviews.FilterMultiInner.__getitem__.new_node_ok
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - nbr
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 354
    functionName: networkx.classes.coreviews.FilterAdjacency.__getitem__.new_node_ok
    functionSourceFile: networkx.classes.coreviews
    functionUses: 3
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.no_filter
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - key
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 406
    functionName: networkx.classes.coreviews.FilterMultiInner.__getitem__.new_node_ok
    functionSourceFile: networkx.classes.coreviews
    functionUses: 3
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.no_filter
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.hide_nodes.<lambda1>
    functionSourceFile: ''
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - items
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 21
    functionName: networkx.classes.filters.no_filter
    functionSourceFile: ''
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 293
    functionName: networkx.classes.coreviews.FilterAtlas.__iter__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.coreviews.FilterAdjacency.__getitem__.new_node_ok
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.no_filter
    - <builtin>.len
    - networkx.classes.coreviews.FilterMultiInner.__getitem__.new_node_ok
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 302
    functionName: networkx.classes.coreviews.FilterAtlas.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.coreviews.FilterAdjacency.__getitem__.new_node_ok
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.no_filter
    - networkx.classes.coreviews.FilterMultiInner.__getitem__.new_node_ok
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 307
    functionName: networkx.classes.coreviews.FilterAtlas.__str__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 310
    functionName: networkx.classes.coreviews.FilterAtlas.__repr__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - d
    - NODE_OK
    - EDGE_OK
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 328
    functionName: networkx.classes.coreviews.FilterAdjacency.__init__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 217
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 333
    functionName: networkx.classes.coreviews.FilterAdjacency.__len__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - collections.abc.Mapping.keys
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.no_filter
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 342
    functionName: networkx.classes.coreviews.FilterAdjacency.__iter__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.no_filter
    - networkx.classes.filters.hide_nodes.<lambda1>
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 351
    functionName: networkx.classes.coreviews.FilterAdjacency.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.no_filter
    - networkx.classes.filters.hide_nodes.<lambda1>
    - <builtin>.set
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.show_multiedges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.hide_diedges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.hide_multidiedges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.show_diedges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b783ca0>
    argNames:
    - u
    - v
    - k
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 225
    functionName: networkx.classes.graphviews.subgraph_view.reverse_edge
    functionSourceFile: networkx.classes.graphviews
    functionUses: 8
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.no_filter
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.show_multidiedges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.hide_edges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.hide_multiedges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters.show_edges.<lambda1>
    functionSourceFile: ''
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 360
    functionName: networkx.classes.coreviews.FilterAdjacency.__str__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 363
    functionName: networkx.classes.coreviews.FilterAdjacency.__repr__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 381
    functionName: networkx.classes.coreviews.FilterMultiInner.__iter__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.no_filter
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nbr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 399
    functionName: networkx.classes.coreviews.FilterMultiInner.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.no_filter
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - <builtin>.any
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 428
    functionName: networkx.classes.coreviews.FilterMultiAdjacency.__getitem__
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.no_filter
    - networkx.classes.filters.hide_nodes.<lambda1>
    - <builtin>.set
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - nbr
    - key
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 431
    functionName: networkx.classes.coreviews.FilterMultiAdjacency.__getitem__.edge_ok
    functionSourceFile: networkx.classes.coreviews
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_multiedges.<lambda1>
    - networkx.classes.filters.hide_multidiedges.<lambda1>
    - networkx.classes.filters.show_diedges.<lambda1>
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.hide_nodes.<lambda1>
    - networkx.classes.filters.no_filter
    - <builtin>.set
    - networkx.classes.graphviews.subgraph_view.reverse_edge
    - networkx.classes.filters.show_multidiedges.<lambda1>
    - networkx.classes.filters.hide_edges.<lambda1>
    - networkx.classes.filters.show_edges.<lambda1>
    - networkx.classes.filters.hide_multiedges.<lambda1>
    - networkx.classes.filters.hide_diedges.<lambda1>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.multigraph
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.classes.multigraph.MultiGraph
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - functools.cached_property
    - networkx.has_path
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90be0>
    - <ast.Constant object at 0x7f734bc902b0>
    argNames:
    - cls
    - incoming_graph_data
    - multigraph_input
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 317
    functionName: networkx.classes.multigraph.MultiGraph.__new__
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached:
    - object.__new__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 385
    functionName: networkx.classes.multigraph.MultiGraph.adj
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 413
    functionName: networkx.classes.multigraph.MultiGraph.new_edge_key
    functionSourceFile: networkx.classes.multigraph
    functionUses: 545
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc7760>
    argNames:
    - self
    - u_for_edge
    - v_for_edge
    - key
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 442
    functionName: networkx.classes.multigraph.MultiGraph.add_edge
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached:
    - datadict.update
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: keydict.get
    functionSourceFile: <builtin>
    functionUses: 545
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ddd.update
    functionSourceFile: <builtin>
    functionUses: 373
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: keylist.append
    functionSourceFile: <builtin>
    functionUses: 373
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24f70>
    argNames:
    - self
    - u
    - v
    - key
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 635
    functionName: networkx.classes.multigraph.MultiGraph.remove_edge
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - d.popitem
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.popitem
    functionSourceFile: <builtin>
    functionUses: 232
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 714
    functionName: networkx.classes.multigraph.MultiGraph.remove_edges_from
    functionSourceFile: networkx.classes.multigraph
    functionUses: 200
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - d.popitem
    - networkx._clear_cache
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b9e1430>
    argNames:
    - self
    - u
    - v
    - key
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 526
    functionName: networkx.classes.multidigraph.MultiDiGraph.remove_edge
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 230
    functionsReached:
    - <builtin>.len
    - d.popitem
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 834
    functionName: networkx.classes.multigraph.MultiGraph.edges
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb553d0>
    - <ast.Constant object at 0x7f734bb55be0>
    argNames:
    - self
    - u
    - v
    - key
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 909
    functionName: networkx.classes.multigraph.MultiGraph.get_edge_data
    functionSourceFile: networkx.classes.multigraph
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1026
    functionName: networkx.classes.multigraph.MultiGraph.is_multigraph
    functionSourceFile: networkx.classes.multigraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d7dc880>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1034
    functionName: networkx.classes.multigraph.MultiGraph.copy
    functionSourceFile: networkx.classes.multigraph
    functionUses: 214
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - datadict.copy
    - networkx.freeze
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.abc.Mapping.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: keydict.items
    functionSourceFile: <builtin>
    functionUses: 233
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cffd0>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 1185
    functionName: networkx.classes.multigraph.MultiGraph.to_undirected
    functionSourceFile: networkx.classes.multigraph
    functionUses: 191
    functionsReached:
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keylist.append
    - networkx.from_numpy_array
    - <builtin>.str
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - networkx.empty_graph
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e6d0>
    - <ast.Constant object at 0x7f734a65e280>
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1238
    functionName: networkx.classes.multigraph.MultiGraph.number_of_edges
    functionSourceFile: networkx.classes.multigraph
    functionUses: 199
    functionsReached:
    - networkx.classes.graph.Graph.size
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.sum
    - networkx.classes.multidigraph.MultiDiGraph.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.multidigraph
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.classes.multidigraph.MultiDiGraph
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - functools.cached_property
    - networkx.has_path
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfe880>
    - <ast.Constant object at 0x7f734cbfed00>
    argNames:
    - cls
    - incoming_graph_data
    - multigraph_input
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 309
    functionName: networkx.classes.multidigraph.MultiDiGraph.__new__
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 0
    functionsReached:
    - object.__new__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 377
    functionName: networkx.classes.multidigraph.MultiDiGraph.adj
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 396
    functionName: networkx.classes.multidigraph.MultiDiGraph.succ
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 415
    functionName: networkx.classes.multidigraph.MultiDiGraph.pred
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.AtlasView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 684
    functionName: networkx.classes.multidigraph.MultiDiGraph.out_edges
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 198
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 690
    functionName: networkx.classes.multidigraph.MultiDiGraph.in_edges
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 213
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 772
    functionName: networkx.classes.multidigraph.MultiDiGraph.in_degree
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 214
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 823
    functionName: networkx.classes.multidigraph.MultiDiGraph.out_degree
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 210
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a34c0>
    - <ast.Constant object at 0x7f734d3a3fd0>
    argNames:
    - self
    - reciprocal
    - as_view
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 880
    functionName: networkx.classes.multidigraph.MultiDiGraph.to_undirected
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 191
    functionsReached:
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keylist.append
    - networkx.from_numpy_array
    - <builtin>.str
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - networkx.empty_graph
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7ee20>
    argNames:
    - self
    - copy
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 955
    functionName: networkx.classes.multidigraph.MultiDiGraph.reverse
    functionSourceFile: networkx.classes.multidigraph
    functionUses: 196
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - networkx.reverse_view
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - H.add_edges_from
    - H.add_nodes_from
    - H.graph.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.classes.filters
    functionSourceFile: networkx.classes.filters
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - nodes
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 26
    functionName: networkx.classes.filters.hide_nodes
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 32
    functionName: networkx.classes.filters.hide_diedges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 38
    functionName: networkx.classes.filters.hide_edges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 44
    functionName: networkx.classes.filters.hide_multidiedges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 50
    functionName: networkx.classes.filters.hide_multiedges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 70
    functionName: networkx.classes.filters.show_nodes.__call__
    functionSourceFile: networkx.classes.filters
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 74
    functionName: networkx.classes.filters.show_diedges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 80
    functionName: networkx.classes.filters.show_edges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 86
    functionName: networkx.classes.filters.show_multidiedges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edges
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 92
    functionName: networkx.classes.filters.show_multiedges
    functionSourceFile: networkx.classes.filters
    functionUses: 1
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.classes.graphviews
    functionSourceFile: networkx.classes.graphviews
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.__class__
    functionSourceFile: <builtin>
    functionUses: 288
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.freeze
    functionSourceFile: ''
    functionUses: 257
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 238
    functionName: networkx.classes.graphviews.reverse_view
    functionSourceFile: networkx.classes.graphviews
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.freeze
    - collections.abc.Mapping.keys
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.classes.function
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 53
    functionName: networkx.classes.function.nodes
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a190d90>
    argNames:
    - G
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 61
    functionName: networkx.classes.function.edges
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a190ac0>
    - <ast.Constant object at 0x7f734a190a90>
    argNames:
    - G
    - nbunch
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 73
    functionName: networkx.classes.function.degree
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 82
    functionName: networkx.classes.function.neighbors
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 90
    functionName: networkx.classes.function.number_of_nodes
    functionSourceFile: networkx.classes.function
    functionUses: 1
    functionsReached:
    - G.number_of_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 98
    functionName: networkx.classes.function.number_of_edges
    functionSourceFile: networkx.classes.function
    functionUses: 1
    functionsReached:
    - G.number_of_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 106
    functionName: networkx.classes.function.density
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.classes.function.number_of_nodes
    - G.number_of_nodes
    - G.number_of_edges
    - networkx.classes.function.number_of_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 141
    functionName: networkx.classes.function.degree_histogram
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - <builtin>.max
    - G.degree
    - collections.Counter.get
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter.get
    functionSourceFile: collections
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 164
    functionName: networkx.classes.function.is_directed
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 169
    functionName: networkx.classes.function.frozen
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 174
    functionName: networkx.classes.function.freeze
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 224
    functionName: networkx.classes.function.is_frozen
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G_to_add_to
    - nodes_for_star
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 242
    functionName: networkx.classes.function.add_star
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - G_to_add_to.add_edges_from
    - G_to_add_to.add_node
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_to_add_to.add_node
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_to_add_to.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G_to_add_to
    - nodes_for_path
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 277
    functionName: networkx.classes.function.add_path
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - keylist.append
    - networkx.utils.misc.pairwise
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - itertools.chain
    - attr_dict.update
    - <builtin>.iter
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.tee
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G_to_add_to
    - nodes_for_cycle
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 309
    functionName: networkx.classes.function.add_cycle
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - itertools.pairwise
    - G_to_add_to.add_node
    - <builtin>.zip
    - G_to_add_to.add_edges_from
    - <builtin>.iter
    - itertools.tee
    - <builtin>.next
    - networkx.utils.misc.pairwise
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 343
    functionName: networkx.classes.function.subgraph
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.subgraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nbunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 366
    functionName: networkx.classes.function.induced_subgraph
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.classes.filters.show_nodes.__init__
    - G.nbunch_iter
    - <builtin>.set
    - networkx.subgraph_view
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.nbunch_iter
    functionSourceFile: <builtin>
    functionUses: 216
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.subgraph_view
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - edges
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 412
    functionName: networkx.classes.function.edge_subgraph
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.filters.show_multiedges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.filters.show_diedges
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.set
    - networkx.classes.filters.show_edges
    - nodes.update
    - networkx.classes.filters.show_multidiedges
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.subgraph_view
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes.update
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - nodes
    - edges
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 471
    functionName: networkx.classes.function.restricted_view
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.classes.filters.hide_multiedges
    - networkx.classes.filters.hide_nodes
    - networkx.classes.filters.hide_edges
    - networkx.classes.filters.hide_multidiedges
    - <builtin>.set
    - G.is_multigraph
    - networkx.classes.filters.hide_diedges
    - networkx.subgraph_view
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 527
    functionName: networkx.classes.function.to_directed
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - graph.to_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.to_directed
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 537
    functionName: networkx.classes.function.to_undirected
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - graph.to_undirected
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.to_undirected
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23f10>
    argNames:
    - G
    - with_data
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 547
    functionName: networkx.classes.function.create_empty_copy
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.__class__
    - G.nodes
    - H.graph.update
    - H.add_nodes_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9c3a0>
    argNames:
    - G
    - values
    - name
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 571
    functionName: networkx.classes.function.set_node_attributes
    functionSourceFile: networkx.classes.function
    functionUses: 2
    functionsReached:
    - <builtin>.iter
    - values.items
    - networkx.classes.graph.Graph.__iter__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values.items
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a9ed8e0>
    argNames:
    - G
    - name
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 673
    functionName: networkx.classes.function.get_node_attributes
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - copy.deepcopy.nodes.items
    - d.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.nodes.items
    functionSourceFile: copy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - attr_names
    - nbunch
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 710
    functionName: networkx.classes.function.remove_node_attributes
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc12df0>
    argNames:
    - G
    - values
    - name
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 747
    functionName: networkx.classes.function.set_edge_attributes
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.hasattr
    - values.items
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - copy.deepcopy.edges
    - copy.deepcopy.is_multigraph
    - nbrs.items
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.is_multigraph
    functionSourceFile: copy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.edges
    functionSourceFile: copy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf340>
    argNames:
    - G
    - name
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 886
    functionName: networkx.classes.function.get_edge_attributes
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.is_multigraph
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - attr_names
    - ebunch
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 929
    functionName: networkx.classes.function.remove_edge_attributes
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.is_multigraph
    - G.edges
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - graph
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 964
    functionName: networkx.classes.function.all_neighbors
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - graph.successors
    - graph.is_directed
    - graph.predecessors
    - itertools.chain
    - graph.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.predecessors
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.successors
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.neighbors
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - graph
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1019
    functionName: networkx.classes.function.non_neighbors
    functionSourceFile: networkx.classes.function
    functionUses: 1
    functionsReached:
    - graph._adj.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph._adj.keys
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1038
    functionName: networkx.classes.function.non_edges
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - graph._adj.keys
    - graph.is_directed
    - <builtin>.set
    - nodes.pop
    - networkx.classes.function.non_neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1064
    functionName: networkx.classes.function.common_neighbors
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e7a00>
    - <ast.Constant object at 0x7f734b6e70a0>
    argNames:
    - G
    - edge
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1100
    functionName: networkx.classes.function.is_weighted
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.get_edge_data
    - <builtin>.any
    - <builtin>.all
    - G.edges
    - networkx.classes.function.is_empty
    - G._adj.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.get_edge_data
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8d30>
    - <ast.Constant object at 0x7f734cbe8f70>
    argNames:
    - G
    - edge
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1154
    functionName: networkx.classes.function.is_negatively_weighted
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - G.edges
    - G.get_edge_data
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G._adj.values
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1231
    functionName: networkx.classes.function.nodes_with_selfloops
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf3940>
    - <ast.Constant object at 0x7f734caf3bb0>
    - <ast.Constant object at 0x7f734bb5f490>
    argNames:
    - G
    - data
    - keys
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1258
    functionName: networkx.classes.function.selfloop_edges
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.range
    - d.get
    - <builtin>.len
    - collections.abc.Mapping.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - path
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1386
    functionName: networkx.classes.function.is_path
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - <builtin>.all
    - networkx.utils.pairwise
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.pairwise
    functionSourceFile: ''
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - path
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1412
    functionName: networkx.classes.function.path_weight
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - networkx.utils.pairwise
    - G.is_multigraph
    - networkx.is_path
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb045b0>
    argNames:
    - G
    - describe_hook
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1450
    functionName: networkx.classes.function.describe
    functionSourceFile: networkx.classes.function
    functionUses: 0
    functionsReached:
    - info_dict.update
    - networkx.degree
    - G.is_directed
    - info.update
    - networkx.number_connected_components
    - <builtin>.max
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.print
    - <builtin>.dict
    - info_dict.items
    - networkx.classes.function._create_describe_info_dict
    - networkx.number_weakly_connected_components
    - networkx.number_strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1518
    functionName: networkx.classes.function._create_describe_info_dict
    functionSourceFile: networkx.classes.function
    functionUses: 1
    functionsReached:
    - networkx.degree
    - G.is_directed
    - info.update
    - networkx.number_connected_components
    - <builtin>.max
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.dict
    - networkx.number_weakly_connected_components
    - networkx.number_strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: info_dict.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: info_dict.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: info.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_strongly_connected_components
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_weakly_connected_components
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_connected_components
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.convert_matrix
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7346483190>
    - <ast.Constant object at 0x7f7346483160>
    - <ast.Constant object at 0x7f7346483130>
    - <ast.Name object at 0x7f7346483100>
    - <ast.Constant object at 0x7f73464830d0>
    - <ast.Constant object at 0x7f73464830a0>
    argNames:
    - G
    - nodelist
    - dtype
    - order
    - multigraph_weight
    - weight
    - nonedge
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 46
    functionName: networkx.convert_matrix.to_pandas_adjacency
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.graph.Graph.number_of_edges
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - numpy.full
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - networkx.convert_matrix.to_numpy_array
    - collections.abc.Mapping.keys
    - ddd.update
    - collections.defaultdict.values
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - i.append
    - collections.abc.Mapping.attr.items
    - collections.defaultdict.keys
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - keylist.append
    - pandas.DataFrame
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - wts.append
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - numpy.array
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - wt.get
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - datadict.items
    - j.append
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 8
    IfCount: 12
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6b09a0>
    - <ast.Constant object at 0x7f734b6b0bb0>
    - <ast.Constant object at 0x7f734b6b03a0>
    - <ast.Name object at 0x7f734b6b0910>
    - <ast.Constant object at 0x7f734cc1d430>
    - <ast.Constant object at 0x7f734cc1dca0>
    argNames:
    - G
    - nodelist
    - dtype
    - order
    - multigraph_weight
    - weight
    - nonedge
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 882
    functionName: networkx.convert_matrix.to_numpy_array
    functionSourceFile: networkx.convert_matrix
    functionUses: 1
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.graph.Graph.number_of_edges
    - <builtin>.zip
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - numpy.full
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - collections.defaultdict.values
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - i.append
    - collections.abc.Mapping.attr.items
    - collections.defaultdict.keys
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - wts.append
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - numpy.array
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - wt.get
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - datadict.items
    - j.append
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pandas.DataFrame
    functionSourceFile: pandas
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734647d5e0>
    argNames:
    - df
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 154
    functionName: networkx.convert_matrix.from_pandas_adjacency
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.sorted
    - <builtin>.zip
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.int
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - A.dtype.fields.items
    - A.nonzero
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.convert_matrix.from_numpy_array
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 3
    IfCount: 10
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67fe20>
    - <ast.Constant object at 0x7f734a67f1f0>
    - <ast.Constant object at 0x7f734a67f970>
    argNames:
    - A
    - parallel_edges
    - create_using
    - edge_attr
    - nodelist
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1121
    functionName: networkx.convert_matrix.from_numpy_array
    functionSourceFile: networkx.convert_matrix
    functionUses: 1
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.sorted
    - <builtin>.zip
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.int
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - A.dtype.fields.items
    - A.nonzero
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    - TypeError
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfbf40>
    - <ast.Constant object at 0x7f734ccfb700>
    - <ast.Constant object at 0x7f734ccfb430>
    - <ast.Constant object at 0x7f734ccfb880>
    - <ast.Constant object at 0x7f734ccfb790>
    argNames:
    - G
    - source
    - target
    - nodelist
    - dtype
    - edge_key
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 220
    functionName: networkx.convert_matrix.to_pandas_edgelist
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - edgelistdict.update
    - d.get
    - <builtin>.set
    - G.is_multigraph
    - <builtin>.float
    - pandas.DataFrame
    - G.edges
    - d.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgelistdict.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 7
    IfCount: 9
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65ea90>
    - <ast.Constant object at 0x7f734a65e3a0>
    - <ast.Constant object at 0x7f734a65e610>
    - <ast.Constant object at 0x7f734a65e2b0>
    - <ast.Constant object at 0x7f734a65ed60>
    argNames:
    - df
    - source
    - target
    - edge_attr
    - create_using
    - edge_key
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 312
    functionName: networkx.convert_matrix.from_pandas_edgelist
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - reserved_columns.append
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.zip
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.empty_graph
    - <builtin>.isinstance
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: reserved_columns.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd27ac0>
    - <ast.Constant object at 0x7f734cd27ca0>
    - <ast.Constant object at 0x7f734cd27790>
    - <ast.Constant object at 0x7f734cd27fd0>
    argNames:
    - G
    - nodelist
    - dtype
    - weight
    - format
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 490
    functionName: networkx.convert_matrix.to_scipy_sparse_array
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - scipy.sparse.coo_array
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.selfloop_edges
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.graph.Graph.subgraph
    - A.asformat
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - result.graph.update
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - A
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 715
    functionName: networkx.convert_matrix._csr_gen_triples
    functionSourceFile: networkx.convert_matrix
    functionUses: 3
    functionsReached:
    - <builtin>.zip
    - A.data.tolist
    - numpy.diff
    - numpy.repeat
    - dst_indices.tolist
    - src_indices.tolist
    - numpy.arange
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.diff
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: src_indices.tolist
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dst_indices.tolist
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.data.tolist
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - A
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 728
    functionName: networkx.convert_matrix._csc_gen_triples
    functionSourceFile: networkx.convert_matrix
    functionUses: 3
    functionsReached:
    - <builtin>.zip
    - A.data.tolist
    - numpy.diff
    - numpy.repeat
    - dst_indices.tolist
    - src_indices.tolist
    - numpy.arange
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - A
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 741
    functionName: networkx.convert_matrix._coo_gen_triples
    functionSourceFile: networkx.convert_matrix
    functionUses: 3
    functionsReached:
    - <builtin>.zip
    - A.col.tolist
    - A.data.tolist
    - A.row.tolist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.row.tolist
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.col.tolist
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - A
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 749
    functionName: networkx.convert_matrix._dok_gen_triples
    functionSourceFile: networkx.convert_matrix
    functionUses: 3
    functionsReached:
    - v.item
    - A.items
    - <builtin>.int
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.items
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v.item
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - A
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 759
    functionName: networkx.convert_matrix._generate_weighted_edges
    functionSourceFile: networkx.convert_matrix
    functionUses: 2
    functionsReached:
    - <builtin>.int
    - networkx.convert_matrix._dok_gen_triples
    - <builtin>.zip
    - A.row.tolist
    - networkx.convert_matrix._csr_gen_triples
    - A.data.tolist
    - A.tocoo
    - numpy.diff
    - numpy.repeat
    - A.col.tolist
    - v.item
    - A.items
    - networkx.convert_matrix._csc_gen_triples
    - dst_indices.tolist
    - src_indices.tolist
    - numpy.arange
    - networkx.convert_matrix._coo_gen_triples
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.tocoo
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e7af0>
    - <ast.Constant object at 0x7f734b6e7f40>
    - <ast.Constant object at 0x7f734b6e7040>
    argNames:
    - A
    - parallel_edges
    - create_using
    - edge_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 777
    functionName: networkx.convert_matrix.from_scipy_sparse_array
    functionSourceFile: networkx.convert_matrix
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.zip
    - networkx.convert_matrix._csr_gen_triples
    - A.data.tolist
    - numpy.diff
    - networkx.convert_matrix._csc_gen_triples
    - numpy.repeat
    - attr.copy
    - newdict.update
    - v.item
    - src_indices.tolist
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.int
    - networkx.convert_matrix._dok_gen_triples
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - dst_indices.tolist
    - networkx.convert_matrix._coo_gen_triples
    - networkx.convert_matrix._generate_weighted_edges
    - A.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - numpy.arange
    - <builtin>.range
    - A.row.tolist
    - A.col.tolist
    - A.tocoo
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.chain.from_iterable
    functionSourceFile: itertools
    functionUses: 225
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.full
    functionSourceFile: numpy
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734827a340>
    argNames:
    - self
    - as_view
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1392
    functionName: networkx.algorithms.planarity.PlanarEmbedding.copy
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 208
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - datadict.copy
    - networkx.freeze
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.abc.Mapping.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.defaultdict.keys
    functionSourceFile: collections
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.defaultdict.values
    functionSourceFile: collections
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: i.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: j.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: wts.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: wt.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.nonzero
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.dtype.fields.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.relabel
    functionSourceFile: networkx.relabel
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4783a0>
    argNames:
    - G
    - mapping
    - copy
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 9
    functionName: networkx.relabel.relabel_nodes
    functionSourceFile: networkx.relabel
    functionUses: 3
    functionsReached:
    - networkx.topological_sort
    - G.__class__
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - mapping.values
    - result.append
    - <builtin>.enumerate
    - H.add_edges_from
    - keylist.append
    - mapping.keys
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - ddd.update
    - <builtin>.reversed
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - H._node.update
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - seen_edges.add
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - H.graph.update
    - networkx.classes.graph.Graph.remove_node
    - attr_dict.update
    - <builtin>.hasattr
    - <builtin>.tuple
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - mapping.items
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.utils.misc.flatten
    - <builtin>.callable
    - networkx.relabel._relabel_inplace
    - H.add_nodes_from
    - networkx.selfloop_edges
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.relabel._relabel_copy
    - networkx.algorithms.operators.all.union_all.add_prefix.label
    - mapping.get
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.operators.binary.full_join.add_prefix.label
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 76
    functionName: networkx.algorithms.operators.all.union_all.add_prefix.label
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 452
    functionName: networkx.algorithms.operators.binary.full_join.add_prefix.label
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - mapping
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 193
    functionName: networkx.relabel._relabel_copy
    functionSourceFile: networkx.relabel
    functionUses: 4
    functionsReached:
    - G.__class__
    - <builtin>.enumerate
    - H.add_edges_from
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - H._node.update
    - seen_edges.add
    - H.graph.update
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - H.add_nodes_from
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - <builtin>.isinstance
    - mapping.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 5
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - mapping
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 130
    functionName: networkx.relabel._relabel_inplace
    functionSourceFile: networkx.relabel
    functionUses: 4
    functionsReached:
    - networkx.topological_sort
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - mapping.values
    - <builtin>.enumerate
    - keylist.append
    - mapping.keys
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - ddd.update
    - <builtin>.reversed
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.remove_node
    - attr_dict.update
    - <builtin>.hasattr
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - mapping.items
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.selfloop_edges
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.classes.digraph.DiGraph.in_edges
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.keys
    functionSourceFile: <builtin>
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.values
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - ebunch
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1240
    functionName: networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 203
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.topological_sort
    functionSourceFile: ''
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 916
    functionName: networkx.algorithms.planarity.PlanarEmbedding.remove_node
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 224
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.get
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H._node.update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen_edges.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bac86a0>
    - <ast.Constant object at 0x7f734bac86d0>
    - <ast.Constant object at 0x7f734bac8eb0>
    argNames:
    - G
    - first_label
    - ordering
    - label_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 227
    functionName: networkx.relabel.convert_node_labels_to_integers
    functionSourceFile: networkx.relabel
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - H.add_edges_from
    - mapping.keys
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - seen_edges.add
    - H.graph.update
    - attr_dict.update
    - networkx.selfloop_edges
    - networkx.algorithms.operators.all.union_all.add_prefix.label
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - dv_pairs.sort
    - keydict.get
    - keylist.append
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.iter
    - <builtin>.callable
    - networkx.relabel._relabel_inplace
    - H.add_nodes_from
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.operators.binary.full_join.add_prefix.label
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - <builtin>.sorted
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - mapping.values
    - result.append
    - networkx.set_node_attributes
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.tuple
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - mapping.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.utils.misc.flatten
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.relabel._relabel_copy
    - <builtin>.range
    - networkx.relabel.relabel_nodes
    - mapping.get
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.topological_sort
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.enumerate
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.reversed
    - dv_pairs.reverse
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - H._node.update
    - <builtin>.list
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dv_pairs.sort
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dv_pairs.reverse
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms
    functionSourceFile: networkx.algorithms
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.richclub
    functionSourceFile: networkx.algorithms.richclub
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 103
    functionName: networkx.algorithms.richclub._compute_rc
    functionSourceFile: networkx.algorithms.richclub
    functionUses: 191
    functionsReached:
    - <builtin>.sorted
    - edge_degrees.pop
    - networkx.degree_histogram
    - itertools.accumulate
    - <builtin>.sum
    - <builtin>.len
    - G.number_of_edges
    - <builtin>.enumerate
    - <builtin>.map
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.copy
    functionSourceFile: <builtin>
    functionUses: 230
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.double_edge_swap
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rc.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.degree_histogram
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.accumulate
    functionSourceFile: itertools
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_degrees.pop
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bridges
    functionSourceFile: networkx.algorithms.bridges
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.chain_decomposition
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.node_connected_component
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.subgraph
    functionSourceFile: <builtin>
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.edges
    functionSourceFile: <builtin>
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd410d0>
    - <ast.Constant object at 0x7f734cd41160>
    argNames:
    - G
    - with_span
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 146
    functionName: networkx.algorithms.bridges.local_bridges
    functionSourceFile: networkx.algorithms.bridges
    functionUses: 0
    functionsReached:
    - networkx.shortest_path_length
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.set
    - <builtin>.callable
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 41
    functionName: networkx.algorithms.shortest_paths.weighted._weight_function
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 44
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.callable
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - nbr
    - d
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 196
    functionName: networkx.algorithms.bridges.local_bridges.hide_edge
    functionSourceFile: networkx.algorithms.bridges
    functionUses: 35
    functionsReached:
    - d.values
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - data.get
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 36
    functionsReached:
    - d.values
    - attr.get
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 36
    functionsReached:
    - data.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.assortativity
    functionSourceFile: networkx.algorithms.assortativity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.assortativity.neighbor_degree
    functionSourceFile: networkx.algorithms.assortativity.neighbor_degree
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 1
    IfCount: 13
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbd7760>
    - <ast.Constant object at 0x7f734cbd70d0>
    - <ast.Constant object at 0x7f734cbd7610>
    - <ast.Constant object at 0x7f734cbd73a0>
    argNames:
    - G
    - source
    - target
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 7
    functionName: networkx.algorithms.assortativity.neighbor_degree.average_neighbor_degree
    functionSourceFile: networkx.algorithms.assortativity.neighbor_degree
    functionUses: 0
    functionsReached:
    - G.is_directed
    - <builtin>.dict
    - <builtin>.sum
    - dd.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.assortativity.connectivity
    functionSourceFile: networkx.algorithms.assortativity.connectivity
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448280>
    - <ast.Constant object at 0x7f734c448820>
    - <ast.Constant object at 0x7f734c448a30>
    - <ast.Constant object at 0x7f734c448c10>
    argNames:
    - G
    - source
    - target
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.assortativity.connectivity.average_degree_connectivity
    functionSourceFile: networkx.algorithms.assortativity.connectivity
    functionUses: 0
    functionsReached:
    - G.is_directed
    - collections.defaultdict.items
    - collections.defaultdict
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.assortativity.pairs
    functionSourceFile: networkx.algorithms.assortativity.pairs
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ceff700>
    argNames:
    - G
    - attribute
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.assortativity.pairs.node_attribute_xy
    functionSourceFile: networkx.algorithms.assortativity.pairs
    functionUses: 4
    functionsReached:
    - G.adjacency
    - <builtin>.set
    - G.is_multigraph
    - nbrsdict.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrsdict.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc98790>
    - <ast.Constant object at 0x7f734cc981f0>
    - <ast.Constant object at 0x7f734cc98490>
    - <ast.Constant object at 0x7f734cc98040>
    argNames:
    - G
    - x
    - y
    - weight
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 69
    functionName: networkx.algorithms.assortativity.pairs.node_degree_xy
    functionSourceFile: networkx.algorithms.assortativity.pairs
    functionUses: 4
    functionsReached:
    - G.is_directed
    - <builtin>.set
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.assortativity.mixing
    functionSourceFile: networkx.algorithms.assortativity.mixing
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfbe80>
    - <ast.Constant object at 0x7f734ccfb190>
    argNames:
    - G
    - attribute
    - nodes
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 19
    functionName: networkx.algorithms.assortativity.mixing.attribute_mixing_dict
    functionSourceFile: networkx.algorithms.assortativity.mixing
    functionUses: 3
    functionsReached:
    - nbrsdict.items
    - d.items
    - <builtin>.set
    - G.is_multigraph
    - networkx.algorithms.assortativity.pairs.node_attribute_xy
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - G.adjacency
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccb6bb0>
    argNames:
    - xy
    - normalized
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 221
    functionName: networkx.algorithms.assortativity.mixing.mixing_dict
    functionSourceFile: networkx.algorithms.assortativity.mixing
    functionUses: 7
    functionsReached:
    - d.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfeb50>
    - <ast.Constant object at 0x7f734cbfe880>
    - <ast.Constant object at 0x7f734cbfe0d0>
    argNames:
    - G
    - attribute
    - nodes
    - mapping
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 58
    functionName: networkx.algorithms.assortativity.mixing.attribute_mixing_matrix
    functionSourceFile: networkx.algorithms.assortativity.mixing
    functionUses: 2
    functionsReached:
    - s.update
    - <builtin>.zip
    - a.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.misc.dict_to_numpy_array
    - networkx.utils.misc._dict_to_numpy_array2
    - numpy.zeros
    - d.items
    - mapping.items
    - G.is_multigraph
    - v.keys
    - networkx.algorithms.assortativity.pairs.node_attribute_xy
    - networkx.algorithms.assortativity.mixing.attribute_mixing_dict
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - G.adjacency
    - <builtin>.range
    - nbrsdict.items
    - networkx.utils.misc._dict_to_numpy_array1
    - <builtin>.dict
    - d.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: a.sum
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41a30>
    - <ast.Constant object at 0x7f734cd41520>
    - <ast.Constant object at 0x7f734cd41f10>
    - <ast.Constant object at 0x7f734cd41ee0>
    - <ast.Constant object at 0x7f734cd41850>
    argNames:
    - G
    - x
    - y
    - weight
    - nodes
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 118
    functionName: networkx.algorithms.assortativity.mixing.degree_mixing_dict
    functionSourceFile: networkx.algorithms.assortativity.mixing
    functionUses: 2
    functionsReached:
    - G.is_directed
    - networkx.algorithms.assortativity.pairs.node_degree_xy
    - d.items
    - <builtin>.set
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448b20>
    - <ast.Constant object at 0x7f734c448cd0>
    - <ast.Constant object at 0x7f734c4485b0>
    - <ast.Constant object at 0x7f734c448940>
    - <ast.Constant object at 0x7f734c448af0>
    - <ast.Constant object at 0x7f734c448610>
    argNames:
    - G
    - x
    - y
    - weight
    - nodes
    - normalized
    - mapping
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 150
    functionName: networkx.algorithms.assortativity.mixing.degree_mixing_matrix
    functionSourceFile: networkx.algorithms.assortativity.mixing
    functionUses: 1
    functionsReached:
    - s.update
    - <builtin>.zip
    - networkx.algorithms.assortativity.pairs.node_degree_xy
    - networkx.algorithms.assortativity.mixing.degree_mixing_dict
    - a.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.misc.dict_to_numpy_array
    - networkx.utils.misc._dict_to_numpy_array2
    - G.is_directed
    - d.items
    - mapping.items
    - v.keys
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - G.edges
    - <builtin>.range
    - networkx.utils.misc._dict_to_numpy_array1
    - <builtin>.dict
    - d.keys
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.assortativity.correlation
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf3d30>
    - <ast.Constant object at 0x7f734caf3400>
    - <ast.Constant object at 0x7f734caf3220>
    - <ast.Constant object at 0x7f734caf3e20>
    argNames:
    - G
    - x
    - y
    - weight
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 19
    functionName: networkx.algorithms.assortativity.correlation.degree_assortativity_coefficient
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 0
    functionsReached:
    - networkx.algorithms.assortativity.correlation._numeric_ac
    - s.update
    - <builtin>.zip
    - networkx.algorithms.assortativity.pairs.node_degree_xy
    - numpy.sqrt
    - mapping.values
    - networkx.algorithms.assortativity.mixing.degree_mixing_dict
    - set.union
    - <builtin>.enumerate
    - mapping.keys
    - numpy.array
    - a.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.misc.dict_to_numpy_array
    - G.in_degree
    - networkx.utils.misc._dict_to_numpy_array2
    - G.is_directed
    - networkx.algorithms.assortativity.mixing.degree_mixing_matrix
    - G.out_degree
    - <builtin>.list
    - d.items
    - mapping.items
    - v.keys
    - <builtin>.float
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - G.edges
    - <builtin>.range
    - numpy.outer
    - M.sum
    - networkx.utils.misc._dict_to_numpy_array1
    - <builtin>.dict
    - d.keys
    - G.degree
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.in_degree
    functionSourceFile: <builtin>
    functionUses: 214
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.out_degree
    functionSourceFile: <builtin>
    functionUses: 211
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: set.union
    functionSourceFile: <builtin>
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - M
    - mapping
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 286
    functionName: networkx.algorithms.assortativity.correlation._numeric_ac
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 2
    functionsReached:
    - M.sum
    - numpy.outer
    - numpy.array
    - numpy.sqrt
    - <builtin>.list
    - mapping.values
    - <builtin>.float
    - mapping.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7edf0>
    - <ast.Constant object at 0x7f734bb7e040>
    - <ast.Constant object at 0x7f734bb7e850>
    - <ast.Constant object at 0x7f734bb7eac0>
    argNames:
    - G
    - x
    - y
    - weight
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 104
    functionName: networkx.algorithms.assortativity.correlation.degree_pearson_correlation_coefficient
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 0
    functionsReached:
    - G.is_directed
    - scipy.stats.pearsonr
    - <builtin>.zip
    - networkx.algorithms.assortativity.pairs.node_degree_xy
    - <builtin>.set
    - <builtin>.float
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.stats.pearsonr
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb04c40>
    argNames:
    - G
    - attribute
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 163
    functionName: networkx.algorithms.assortativity.correlation.attribute_assortativity_coefficient
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 0
    functionsReached:
    - s.update
    - <builtin>.zip
    - networkx.algorithms.assortativity.correlation.attribute_ac
    - M.trace
    - a.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.misc.dict_to_numpy_array
    - networkx.utils.misc._dict_to_numpy_array2
    - d.items
    - mapping.items
    - G.is_multigraph
    - v.keys
    - networkx.algorithms.assortativity.pairs.node_attribute_xy
    - <builtin>.float
    - networkx.algorithms.assortativity.mixing.attribute_mixing_dict
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - networkx.algorithms.assortativity.mixing.attribute_mixing_matrix
    - G.adjacency
    - <builtin>.range
    - nbrsdict.items
    - M.sum
    - networkx.utils.misc._dict_to_numpy_array1
    - <builtin>.dict
    - d.keys
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - M
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 259
    functionName: networkx.algorithms.assortativity.correlation.attribute_ac
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 1
    functionsReached:
    - M.trace
    - M.sum
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e040>
    argNames:
    - G
    - attribute
    - nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 210
    functionName: networkx.algorithms.assortativity.correlation.numeric_assortativity_coefficient
    functionSourceFile: networkx.algorithms.assortativity.correlation
    functionUses: 0
    functionsReached:
    - networkx.algorithms.assortativity.correlation._numeric_ac
    - s.update
    - <builtin>.zip
    - numpy.sqrt
    - mapping.values
    - <builtin>.enumerate
    - mapping.keys
    - numpy.array
    - a.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.misc.dict_to_numpy_array
    - networkx.utils.misc._dict_to_numpy_array2
    - <builtin>.list
    - d.items
    - mapping.items
    - G.is_multigraph
    - v.keys
    - networkx.algorithms.assortativity.pairs.node_attribute_xy
    - <builtin>.float
    - networkx.algorithms.assortativity.mixing.attribute_mixing_dict
    - networkx.algorithms.assortativity.mixing.mixing_dict
    - networkx.algorithms.assortativity.mixing.attribute_mixing_matrix
    - G.adjacency
    - <builtin>.range
    - nbrsdict.items
    - numpy.outer
    - M.sum
    - networkx.utils.misc._dict_to_numpy_array1
    - <builtin>.dict
    - d.keys
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: M.trace
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.distance_regular
    functionSourceFile: networkx.algorithms.distance_regular
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - c
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 72
    functionName: networkx.algorithms.distance_regular.global_parameters
    functionSourceFile: networkx.algorithms.distance_regular
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_regular
    functionSourceFile: ''
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.log
    functionSourceFile: math
    functionUses: 216
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.combinations_with_replacement
    functionSourceFile: itertools
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_shortest_path_length
    functionSourceFile: ''
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pl_u.update
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pl_u.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pl_n.update
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pl_n.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cint.get
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bint.get
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e760>
    - <ast.Constant object at 0x7f734c43e1f0>
    - <ast.Constant object at 0x7f734c43e3d0>
    argNames:
    - G
    - e
    - usebounds
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 338
    functionName: networkx.algorithms.distance_measures.diameter
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 191
    functionsReached:
    - G.is_directed
    - networkx.shortest_path_length
    - networkx.algorithms.distance_measures.eccentricity
    - <builtin>.max
    - G.order
    - <builtin>.min
    - dist.values
    - <builtin>.len
    - e.values
    - G.nbunch_iter
    - length.values
    - <builtin>.dict
    - <builtin>.set
    - dict.fromkeys
    - G.degree
    - ruled_out.update
    - networkx.algorithms.distance_measures._extrema_bounding
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.regular
    functionSourceFile: networkx.algorithms.regular
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 10
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734caee430>
    argNames:
    - G
    - k
    - matching_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.algorithms.regular.k_factor
    functionSourceFile: networkx.algorithms.regular
    functionUses: 0
    functionsReached:
    - g.add_edge
    - g.remove_node
    - <builtin>.range
    - networkx.is_perfect_matching
    - g.remove_edges_from
    - g.remove_nodes_from
    - <builtin>.zip
    - networkx.max_weight_matching
    - g.add_edges_from
    - gadgets.append
    - G.copy
    - <builtin>.set
    - <builtin>.any
    - g.add_node
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.add_edge
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.remove_node
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gadgets.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.max_weight_matching
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_perfect_matching
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.add_node
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.dominance
    functionSourceFile: networkx.algorithms.dominance
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dfs_postorder_nodes
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: order.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: order.reverse
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 72
    functionName: networkx.algorithms.dominance.immediate_dominators.intersect
    functionSourceFile: networkx.algorithms.dominance
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: functools.reduce
    functionSourceFile: functools
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.immediate_dominators
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.reciprocity
    functionSourceFile: networkx.algorithms.reciprocity
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 61
    functionName: networkx.algorithms.reciprocity._reciprocity_iter
    functionSourceFile: networkx.algorithms.reciprocity
    functionUses: 191
    functionsReached:
    - G.successors
    - G.predecessors
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.predecessors
    functionSourceFile: <builtin>
    functionUses: 205
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.successors
    functionSourceFile: <builtin>
    functionUses: 206
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.to_undirected
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.polynomials
    functionSourceFile: networkx.algorithms.polynomials
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sympy.Symbol
    functionSourceFile: sympy
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque.append
    functionSourceFile: collections
    functionUses: 243
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque.pop
    functionSourceFile: collections
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.contracted_edge
    functionSourceFile: ''
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.remove_edge
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.remove_edge
    functionSourceFile: <builtin>
    functionUses: 207
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sympy.simplify
    functionSourceFile: sympy
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.hybrid
    functionSourceFile: networkx.algorithms.hybrid
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b9e1fd0>
    - <ast.Constant object at 0x7f734b9e1820>
    argNames:
    - G
    - k
    - l
    - low_memory
    - same_as_graph
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 15
    functionName: networkx.algorithms.hybrid.kl_connected_subgraph
    functionSourceFile: networkx.algorithms.hybrid
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - G.subgraph
    - verts.copy
    - networkx.shortest_path
    - <builtin>.list
    - verts.update
    - G2.remove_edge
    - copy.deepcopy
    - H.remove_edge
    - H.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: verts.copy
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: verts.update
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.remove_edge
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.shortest_path
    functionSourceFile: ''
    functionUses: 207
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.remove_edge
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.smetric
    functionSourceFile: networkx.algorithms.smetric
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.mis
    functionSourceFile: networkx.algorithms.mis
    functionUses: 0
    functionsReached:
    - networkx.utils.py_random_state
    - networkx.utils.decorators.py_random_state
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.choice
    functionSourceFile: <builtin>
    functionUses: 240
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes.issubset
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: set.intersection
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neighbors.union
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: indep_nodes.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: available_nodes.difference_update
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.chordal
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b783ac0>
    - <ast.Attribute object at 0x7f734b783490>
    argNames:
    - G
    - s
    - treewidth_bound
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 333
    functionName: networkx.algorithms.chordal._find_chordality_breaker
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 193
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.graph.Graph.number_of_edges
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.number_of_selfloops
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - unnumbered.remove
    - networkx.algorithms.chordal._max_cardinality_node
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.chordal._find_missing_edge
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.chordal._is_complete_graph
    - <builtin>.iter
    - <builtin>.isinstance
    - missing.pop
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - numbered.add
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - N.graph.update
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.freeze
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: induced_nodes.update
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: induced_nodes.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.number_of_nodes
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.nodes
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unnumbered.remove
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - choices
    - wanna_connect
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 320
    functionName: networkx.algorithms.chordal._max_cardinality_node
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 196
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numbered.add
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.neighbors
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.subgraph
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 299
    functionName: networkx.algorithms.chordal._is_complete_graph
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 196
    functionsReached:
    - networkx.classes.graph.Graph.number_of_edges
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - networkx.classes.graph.Graph.size
    - <builtin>.int
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.number_of_selfloops
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_clique_wanna_be.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.chordal_graph_cliques
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 311
    functionName: networkx.algorithms.chordal._find_missing_edge
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 194
    functionsReached:
    - <builtin>.set
    - missing.pop
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: missing.pop
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 374
    functionName: networkx.algorithms.chordal.complete_to_chordal_graph
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - chords.add
    - <builtin>.max
    - networkx.has_path
    - unnumbered_nodes.remove
    - <builtin>.list
    - <builtin>.len
    - G.has_edge
    - G.copy
    - update_nodes.append
    - <builtin>.set
    - H.add_edges_from
    - H.subgraph
    - H.nodes
    - networkx.is_chordal
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_chordal
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.nodes
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.chordal.complete_to_chordal_graph.<lambda1>
    functionSourceFile: networkx.algorithms.chordal
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unnumbered_nodes.remove
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: update_nodes.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.has_path
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: chords.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.components
    functionSourceFile: networkx.algorithms.components
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.components.strongly_connected
    functionSourceFile: networkx.algorithms.components.strongly_connected
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.append
    functionSourceFile: <builtin>
    functionUses: 223
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.pop
    functionSourceFile: <builtin>
    functionUses: 207
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scc_queue.pop
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scc.add
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scc_found.update
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scc_queue.append
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.reverse
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: post.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90280>
    argNames:
    - G
    - scc
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 279
    functionName: networkx.algorithms.components.strongly_connected.condensation
    functionSourceFile: networkx.algorithms.components.strongly_connected
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.range
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - mapping.update
    - attr.copy
    - networkx._clear_cache
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.enumerate
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.set_node_attributes
    - networkx.strongly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.update
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.components.weakly_connected
    functionSourceFile: networkx.algorithms.components.weakly_connected
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - n
    - source
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 169
    functionName: networkx.algorithms.components.weakly_connected._plain_bfs
    functionSourceFile: networkx.algorithms.components.weakly_connected
    functionUses: 205
    functionsReached:
    - <builtin>.len
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen.update
    functionSourceFile: <builtin>
    functionUses: 211
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nextlevel.append
    functionSourceFile: <builtin>
    functionUses: 230
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.components.connected
    functionSourceFile: networkx.algorithms.components.connected
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - n
    - source
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 267
    functionName: networkx.algorithms.components.connected._plain_bfs
    functionSourceFile: networkx.algorithms.components.connected
    functionUses: 209
    functionsReached:
    - <builtin>.len
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.components.biconnected
    functionSourceFile: networkx.algorithms.components.biconnected
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 10
    IfCount: 13
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d4b08e0>
    argNames:
    - G
    - components
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 339
    functionName: networkx.algorithms.components.biconnected._biconnected_dfs
    functionSourceFile: networkx.algorithms.components.biconnected
    functionUses: 198
    functionsReached:
    - stack.append
    - visited.add
    - edge_stack.append
    - stack.pop
    - <builtin>.min
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_stack.append
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.components.attracting
    functionSourceFile: networkx.algorithms.components.attracting
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.components.semiconnected
    functionSourceFile: networkx.algorithms.components.semiconnected
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.wiener
    functionSourceFile: networkx.algorithms.wiener
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.contracted_edge
    - networkx.utils.not_implemented_for
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c8deee0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 26
    functionName: networkx.algorithms.wiener.wiener_index
    functionSourceFile: networkx.algorithms.wiener
    functionUses: 0
    functionsReached:
    - G.is_directed
    - itertools.chain.from_iterable
    - networkx.shortest_path_length
    - nbrs.values
    - networkx.is_connected
    - networkx.is_strongly_connected
    - <builtin>.sum
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c3fb490>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 98
    functionName: networkx.algorithms.wiener.schultz_index
    functionSourceFile: networkx.algorithms.wiener
    functionUses: 0
    functionsReached:
    - networkx.shortest_path_length
    - info.items
    - networkx.is_connected
    - <builtin>.sum
    - <builtin>.dict
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: info.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3400>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 166
    functionName: networkx.algorithms.wiener.gutman_index
    functionSourceFile: networkx.algorithms.wiener
    functionUses: 0
    functionsReached:
    - networkx.shortest_path_length
    - vinfo.items
    - networkx.is_connected
    - <builtin>.sum
    - <builtin>.dict
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vinfo.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d4b0520>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 232
    functionName: networkx.algorithms.wiener.hyper_wiener_index
    functionSourceFile: networkx.algorithms.wiener
    functionUses: 0
    functionsReached:
    - networkx.shortest_path_length
    - lengths.values
    - networkx.is_connected
    - <builtin>.sum
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lengths.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.dominating
    functionSourceFile: networkx.algorithms.dominating
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.not_implemented_for
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: remaining_nodes.pop
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dominating_set.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unseen_degree.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.dominating.connected_dominating_set.<lambda1>
    functionSourceFile: networkx.algorithms.dominating
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unseen.remove
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: connected_dominating_set.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_dominating_set
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.subgraph
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.dag
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bfs_edges
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: zero_indegree.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.topological_generations
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - node
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 415
    functionName: networkx.algorithms.dag.lexicographical_topological_sort.key
    functionSourceFile: networkx.algorithms.dag
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - node
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 420
    functionName: networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    functionSourceFile: networkx.algorithms.dag
    functionUses: 191
    functionsReached:
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: heapq.heapify
    functionSourceFile: heapq
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: current_sort.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.out_edges
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque.appendleft
    functionSourceFile: collections
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bases.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: current_sort.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bases.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.gcd
    functionSourceFile: math
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: next_level.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a5bb6d0>
    argNames:
    - G
    - reflexive
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 718
    functionName: networkx.algorithms.dag.transitive_closure
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - keydict.get
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - networkx.edge_bfs
    - networkx.descendants
    - datadict.copy
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.abc.Mapping.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.descendants
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.edge_bfs
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f490>
    argNames:
    - G
    - topo_order
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 811
    functionName: networkx.algorithms.dag.transitive_closure_dag
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - networkx.algorithms.dag.topological_sort
    - <builtin>.reversed
    - networkx.descendants_at_distance
    - networkx.topological_generations
    - <builtin>.list
    - TC.add_edges_from
    - G.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.descendants_at_distance
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: TC.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 868
    functionName: networkx.algorithms.dag.transitive_reduction
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.dag.topological_sort
    - networkx.algorithms.dag.has_cycle
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.dfs_edges
    - G.nodes
    - networkx._clear_cache
    - attr.copy
    - networkx.topological_generations
    - <builtin>.iter
    - <builtin>.dict
    - newdict.update
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - collections.deque
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dfs_edges
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.transitive_closure_dag
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: antichains_stacks.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: antichains_stacks.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3310>
    - <ast.Constant object at 0x7f734d3a3460>
    - <ast.Constant object at 0x7f734d3a3eb0>
    argNames:
    - G
    - weight
    - default_weight
    - topo_order
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1008
    functionName: networkx.algorithms.dag.dag_longest_path
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - networkx.topological_sort
    - <builtin>.max
    - path.append
    - path.reverse
    - G.is_multigraph
    - data.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.dag.dag_longest_path.<lambda1>
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - x.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.dag.dag_longest_path.<lambda2>
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.dag.dag_longest_path.<lambda3>
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.reverse
    functionSourceFile: <builtin>
    functionUses: 234
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d38c940>
    - <ast.Constant object at 0x7f734d38c640>
    argNames:
    - G
    - weight
    - default_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1106
    functionName: networkx.algorithms.dag.dag_longest_path_length
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - itertools.pairwise
    - <builtin>.zip
    - <builtin>.max
    - networkx.dag_longest_path
    - itertools.tee
    - G.is_multigraph
    - <builtin>.next
    - networkx.utils.misc.pairwise
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dag_longest_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.dag.dag_longest_path_length.<lambda1>
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.starmap
    functionSourceFile: itertools
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1181
    functionName: networkx.algorithms.dag.dag_to_branching
    functionSourceFile: networkx.algorithms.dag
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - networkx.algorithms.dag.topological_sort
    - networkx._clear_cache
    - G.out_degree
    - networkx.prefix_tree
    - networkx.topological_generations
    - networkx.algorithms.dag.root_to_leaf_paths
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.dag.has_cycle
    - G.in_degree
    - itertools.product
    - itertools.starmap
    - collections.deque
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.prefix_tree
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.combinations
    functionSourceFile: itertools
    functionUses: 269
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.tree
    functionSourceFile: networkx.algorithms.tree
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.branchings
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - docstring_branching.format
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - numpy.mean
    - networkx.classes.graph.Graph.__init__
    - networkx.to_numpy_array
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - collections.deque
    - networkx.utils.union_find.UnionFind.union
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - backward_visited.add
    - G.reverse
    - unmatched.append
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - docstring_arborescence.format
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - networkx.algorithms.chordal.chordal_graph_cliques
    - B_cal_prime.add
    - G.degree
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - networkx.algorithms.approximation.clique.large_clique_size
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - networkx.classes.reportviews.InEdgeView.__init__
    - d.copy
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - length.items
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7345442370>
    - <ast.Constant object at 0x7f7345442340>
    argNames:
    - L
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 63
    functionName: networkx.algorithms.tree.branchings.random_string
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - seed.choice
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - weight
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 67
    functionName: networkx.algorithms.tree.branchings._min_weight
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - weight
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 71
    functionName: networkx.algorithms.tree.branchings._max_weight
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7345eeabb0>
    - <ast.Constant object at 0x7f7345eeab80>
    argNames:
    - G
    - attr
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.algorithms.tree.branchings.branching_weight
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - G.edges
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 6
    IfCount: 6
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7345eea430>
    - <ast.Constant object at 0x7f7345eea400>
    - <ast.Constant object at 0x7f7345ee6760>
    - <ast.Constant object at 0x7f7345ee6730>
    argNames:
    - G
    - attr
    - default
    - kind
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 111
    functionName: networkx.algorithms.tree.branchings.greedy_branching
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - data.get
    - <builtin>.len
    - operator.itemgetter
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - <builtin>.hasattr
    - edges.sort
    - <builtin>.list
    - <builtin>.iter
    - G.edges
    - networkx.utils.union_find.UnionFind.union
    - <builtin>.range
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.algorithms.tree.branchings.random_string
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.sort
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 15
    IfCount: 13
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77aa60>
    - <ast.Constant object at 0x7f734b77a550>
    - <ast.Constant object at 0x7f734b77a370>
    - <ast.Constant object at 0x7f734b77a5e0>
    argNames:
    - G
    - attr
    - default
    - preserve_attrs
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 191
    functionName: networkx.algorithms.tree.branchings.maximum_branching
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 4
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge
    - minedge_circuit.append
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - data.items
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.tree.branchings.maximum_branching.is_root
    - Q_edges.append
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.algorithms.tree.recognition.is_forest
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2
    - selected_nodes.difference_update
    - edges.remove
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - circuits.append
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - <builtin>.hasattr
    - <builtin>.iter
    - H.add_nodes_from
    - <builtin>.isinstance
    - selected_nodes.add
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - branchings.append
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - c.number_of_edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - graphs.append
    - networkx.classes.digraph.DiGraph.remove_node
    - collections.abc.Mapping.items
    - data.copy
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - G_original.__class__
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - data.get
    - G_edge_index.copy
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - B_edge_index.copy
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.utils.union_find.UnionFind.union
    - networkx.freeze
    - result.graph.update
    - new_edges.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - edge_index
    - u
    - v
    - key
    - d
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 202
    functionName: networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 6
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - Exception
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - edge_index
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 235
    functionName: networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 6
    functionsReached:
    - keys.update
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: keys.update
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 335
    functionName: networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 5
    functionsReached:
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - nbrs.items
    - data.get
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 15
    IfCount: 6
    argCount: 3
    argDefaultValues: []
    argNames:
    - v
    - desired_edge
    - level
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 372
    functionName: networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 5
    functionsReached:
    - circuits.append
    - <builtin>.sorted
    - G.graph.update
    - G.__class__
    - data.copy
    - minedge_circuit.append
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - keydict.items
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - keydict.get
    - <builtin>.str
    - <builtin>.enumerate
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - keys.update
    - G.add_edges_from
    - datadict.update
    - collections.abc.Mapping.keys
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - data.get
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - G_edge_index.copy
    - <builtin>.set
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - Q_edges.append
    - <builtin>.next
    - B_edge_index.copy
    - attr_dict.update
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - d.copy
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - selected_nodes.difference_update
    - networkx.utils.union_find.UnionFind.union
    - collections.abc.Mapping.items
    - datadict.copy
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - branchings.append
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.digraph.DiGraph.is_directed
    - new_edges.append
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - graphs.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q_edges.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: circuits.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: minedge_circuit.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_edge_index.copy
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graphs.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B_edge_index.copy
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: branchings.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_edges.append
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: selected_nodes.difference_update
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - u
    - edgekeys
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 459
    functionName: networkx.algorithms.tree.branchings.maximum_branching.is_root
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - Exception
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: selected_nodes.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_original.__class__
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.update
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.remove
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.add_edge
    functionSourceFile: <builtin>
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7e9a0>
    - <ast.Constant object at 0x7f734bb7ecd0>
    - <ast.Constant object at 0x7f734bb7eb50>
    - <ast.Constant object at 0x7f734bb7e040>
    argNames:
    - G
    - attr
    - default
    - preserve_attrs
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 618
    functionName: networkx.algorithms.tree.branchings.minimum_branching
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge
    - minedge_circuit.append
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - data.items
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.tree.branchings.maximum_branching.is_root
    - Q_edges.append
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.algorithms.tree.recognition.is_forest
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2
    - selected_nodes.difference_update
    - edges.remove
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - circuits.append
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    - <builtin>.hasattr
    - <builtin>.iter
    - H.add_nodes_from
    - <builtin>.isinstance
    - selected_nodes.add
    - B.edges
    - networkx.algorithms.tree.branchings.maximum_branching
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - branchings.append
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - G.edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - c.number_of_edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - graphs.append
    - networkx.empty_graph
    - datadict.items
    - networkx.classes.digraph.DiGraph.remove_node
    - collections.abc.Mapping.items
    - data.copy
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - G_original.__class__
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - data.get
    - G_edge_index.copy
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - B_edge_index.copy
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.utils.union_find.UnionFind.union
    - networkx.freeze
    - result.graph.update
    - new_edges.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B.edges
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - attr
    - default
    - preserve_attrs
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 639
    functionName: networkx.algorithms.tree.branchings.minimal_branching
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 1
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge
    - minedge_circuit.append
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - data.items
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.tree.branchings.maximum_branching.is_root
    - Q_edges.append
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.algorithms.tree.recognition.is_forest
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2
    - selected_nodes.difference_update
    - edges.remove
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - circuits.append
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    - <builtin>.hasattr
    - <builtin>.iter
    - H.add_nodes_from
    - <builtin>.isinstance
    - selected_nodes.add
    - B.edges
    - networkx.algorithms.tree.branchings.maximum_branching
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - branchings.append
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - G.edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - c.number_of_edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - graphs.append
    - networkx.empty_graph
    - datadict.items
    - networkx.classes.digraph.DiGraph.remove_node
    - collections.abc.Mapping.items
    - data.copy
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - G_original.__class__
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - data.get
    - G_edge_index.copy
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - B_edge_index.copy
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.utils.union_find.UnionFind.union
    - networkx.freeze
    - result.graph.update
    - new_edges.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e130>
    - <ast.Constant object at 0x7f734c43e7c0>
    - <ast.Constant object at 0x7f734c43e5e0>
    - <ast.Constant object at 0x7f734c43e3a0>
    argNames:
    - G
    - attr
    - default
    - preserve_attrs
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 703
    functionName: networkx.algorithms.tree.branchings.maximum_spanning_arborescence
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge
    - minedge_circuit.append
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - data.items
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.tree.branchings.maximum_branching.is_root
    - Q_edges.append
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.algorithms.tree.recognition.is_forest
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2
    - selected_nodes.difference_update
    - edges.remove
    - d.get
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - circuits.append
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - networkx.algorithms.components.connected._plain_bfs
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    - G.is_directed
    - <builtin>.hasattr
    - <builtin>.iter
    - networkx.algorithms.components.connected.is_connected
    - H.add_nodes_from
    - <builtin>.isinstance
    - selected_nodes.add
    - B.edges
    - networkx.algorithms.tree.branchings.maximum_branching
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - branchings.append
    - H.add_edge
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - <builtin>.dict
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.tree.recognition.is_tree
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - nextlevel.append
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - G.edges
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - c.number_of_edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - graphs.append
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.remove_node
    - datadict.items
    - data.copy
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - G_original.__class__
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - data.get
    - G_edge_index.copy
    - seen.update
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - <builtin>.next
    - B_edge_index.copy
    - G.in_degree
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.utils.union_find.UnionFind.union
    - networkx.freeze
    - result.graph.update
    - new_edges.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16dc0>
    - <ast.Constant object at 0x7f734ab16eb0>
    - <ast.Constant object at 0x7f734ab16490>
    - <ast.Constant object at 0x7f734ab16730>
    argNames:
    - G
    - attr
    - default
    - preserve_attrs
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 11
    functionLinenumber: 745
    functionName: networkx.algorithms.tree.branchings.minimum_spanning_arborescence
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge
    - minedge_circuit.append
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.weakly_connected_components
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - data.items
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.tree.branchings.maximum_branching.is_root
    - Q_edges.append
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.algorithms.tree.recognition.is_forest
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2
    - selected_nodes.difference_update
    - edges.remove
    - networkx.algorithms.tree.recognition.is_arborescence
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - circuits.append
    - collections.abc.Mapping.attr.items
    - networkx.connected_components
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.items
    - keydict.get
    - networkx.algorithms.components.connected._plain_bfs
    - keylist.append
    - <builtin>.all
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge
    - G.is_directed
    - <builtin>.hasattr
    - <builtin>.iter
    - networkx.algorithms.components.connected.is_connected
    - H.add_nodes_from
    - <builtin>.isinstance
    - selected_nodes.add
    - B.edges
    - networkx.algorithms.tree.branchings.maximum_branching
    - datadict.copy
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - branchings.append
    - H.add_edge
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - <builtin>.dict
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.tree.recognition.is_tree
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - nextlevel.append
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - G.edges
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - c.number_of_edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - graphs.append
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.remove_node
    - datadict.items
    - data.copy
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - G_original.__class__
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.algorithms.tree.branchings.minimal_branching
    - networkx.classes.filters.show_nodes.__init__
    - data.get
    - G_edge_index.copy
    - seen.update
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - <builtin>.next
    - B_edge_index.copy
    - G.in_degree
    - networkx.classes.graph.Graph.__init__
    - <builtin>.list
    - d.items
    - d.copy
    - N.graph.update
    - networkx.utils.union_find.UnionFind.union
    - networkx.freeze
    - result.graph.update
    - new_edges.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: docstring_branching.format
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: docstring_arborescence.format
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dataclasses.field
    functionSourceFile: dataclasses
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator.Partition
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - dataclasses.field
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 853
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb970>
    - <ast.Constant object at 0x7f734ccfbf40>
    - <ast.Constant object at 0x7f734ccfb7c0>
    argNames:
    - self
    - G
    - weight
    - minimum
    - init_partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 858
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator.__init__
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 0
    functionsReached:
    - G.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 901
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 5
    functionsReached:
    - d.get
    - queue.PriorityQueue.put
    - networkx._clear_cache
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - queue.PriorityQueue
    - G.edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.PriorityQueue
    functionSourceFile: queue
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1035
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 7
    functionsReached:
    - G.edges
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1000
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 8
    functionsReached:
    - d.get
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.PriorityQueue.put
    functionSourceFile: queue
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 935
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator.__next__
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 5
    functionsReached:
    - p1_mst.size
    - queue.PriorityQueue.get
    - d.get
    - networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    - queue.PriorityQueue.put
    - networkx._clear_cache
    - G.edges
    - partition.partition_dict.copy
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - p2.partition_dict.copy
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - queue.PriorityQueue.empty
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.PriorityQueue.empty
    functionSourceFile: queue
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.PriorityQueue.get
    functionSourceFile: queue
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - partition
    - partition_arborescence
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 960
    functionName: networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    functionSourceFile: networkx.algorithms.tree.branchings
    functionUses: 6
    functionsReached:
    - p1_mst.size
    - d.get
    - queue.PriorityQueue.put
    - partition.partition_dict.copy
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - p2.partition_dict.copy
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: partition.partition_dict.copy
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p1_mst.size
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p2.partition_dict.copy
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.recognition
    functionSourceFile: networkx.algorithms.tree.recognition
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.not_implemented_for
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.weakly_connected_components
    functionSourceFile: ''
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: c.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.coding
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a340>
    argNames:
    - T
    - root
    - canonical_form
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 37
    functionName: networkx.algorithms.tree.coding.to_nested_tuple
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - <builtin>.tuple
    - networkx.is_tree
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.tree.coding.to_nested_tuple._make_tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - T
    - root
    - _parent
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 103
    functionName: networkx.algorithms.tree.coding.to_nested_tuple._make_tuple
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - <builtin>.tuple
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.tree.coding.to_nested_tuple._make_tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_tree
    functionSourceFile: ''
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4eb0>
    argNames:
    - sequence
    - sensible_relabeling
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 133
    functionName: networkx.algorithms.tree.coding.from_nested_tuple
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 0
    functionsReached:
    - networkx.algorithms.tree.join_trees
    - networkx.algorithms.tree.coding.from_nested_tuple._make_tree
    - networkx.empty_graph
    - <builtin>.len
    - networkx.relabel_nodes
    - <builtin>.enumerate
    - networkx.bfs_edges
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 183
    functionName: networkx.algorithms.tree.coding.from_nested_tuple._make_tree
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 1
    functionsReached:
    - networkx.algorithms.tree.join_trees
    - <builtin>.len
    - networkx.algorithms.tree.coding.from_nested_tuple._make_tree
    - networkx.empty_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.join_trees
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - T
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 218
    functionName: networkx.algorithms.tree.coding.to_prufer_sequence
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 0
    functionsReached:
    - networkx.algorithms.tree.coding.to_prufer_sequence.parents
    - <builtin>.range
    - T.degree
    - networkx.is_tree
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - result.append
    - <builtin>.next
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.degree
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - u
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 302
    functionName: networkx.algorithms.tree.coding.to_prufer_sequence.parents
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 1
    functionsReached:
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 319
    functionName: networkx.algorithms.tree.coding.from_prufer_sequence
    functionSourceFile: networkx.algorithms.tree.coding
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - not_orphaned.add
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - <builtin>.set
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - collections.Counter
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: not_orphaned.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.operations
    functionSourceFile: networkx.algorithms.tree.operations
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 5
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - rooted_trees
    - label_attribute
    - first_label
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 13
    functionName: networkx.algorithms.tree.operations.join_trees
    functionSourceFile: networkx.algorithms.tree.operations
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - tree.nodes
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - R.update
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.type
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.convert.from_edgelist
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - new_roots.append
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - functools.partial
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - networkx.empty_graph
    - <builtin>.iter
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - R.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.accumulate
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - R.add_edges_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tree.nodes
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_roots.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.add_node
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.distance_measures
    functionSourceFile: networkx.algorithms.tree.distance_measures
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.not_implemented_for
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 14
    functionName: networkx.algorithms.tree.distance_measures.center
    functionSourceFile: networkx.algorithms.tree.distance_measures
    functionUses: 0
    functionsReached:
    - <builtin>.list
    - <builtin>.dict
    - center_candidates_degree.items
    - <builtin>.len
    - <builtin>.set
    - new_leaves.add
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: center_candidates_degree.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_leaves.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 90
    functionName: networkx.algorithms.tree.distance_measures._subtree_sizes
    functionSourceFile: networkx.algorithms.tree.distance_measures
    functionUses: 191
    functionsReached:
    - stack.append
    - networkx.utils.pairwise
    - <builtin>.reversed
    - networkx.dfs_edges
    - stack.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - prev
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 207
    functionName: networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    functionSourceFile: networkx.algorithms.tree.distance_measures
    functionUses: 191
    functionsReached:
    - <builtin>.max
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sizes.get
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.decomposition
    functionSourceFile: networkx.algorithms.tree.decomposition
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 7
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 14
    functionName: networkx.algorithms.tree.decomposition.junction_tree
    functionSourceFile: networkx.algorithms.tree.decomposition
    functionUses: 0
    functionsReached:
    - networkx.classes.graph.Graph.number_of_edges
    - new_clique_wanna_be.add
    - update_nodes.append
    - H.add_edges_from
    - H.subgraph
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - C.nodes
    - <builtin>.max
    - networkx.number_of_selfloops
    - junction_tree.edges
    - C.neighbors
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.has_edge
    - itertools.combinations
    - G.copy
    - attr.copy
    - keydict.get
    - unnumbered.remove
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.algorithms.components.connected._plain_bfs
    - junction_tree.add_node
    - G.pred.values
    - seen.add
    - set_edge_0.isdisjoint
    - C.subgraph
    - unnumbered_nodes.remove
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - set_edge_0.intersection
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.chordal._is_complete_graph
    - chords.add
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx._clear_cache
    - <builtin>.sorted
    - junction_tree.remove_edge
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - C.number_of_nodes
    - junction_tree.add_edge
    - nextlevel.append
    - G.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - H.nodes
    - <builtin>.tuple
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - networkx.algorithms.components.connected.connected_components
    - networkx.has_path
    - networkx.algorithms.chordal.complete_to_chordal_graph
    - networkx.classes.graph.Graph.__iter__
    - networkx.is_chordal
    - numbered.add
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - seen.update
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - <builtin>.frozenset
    - <builtin>.list
    - networkx.algorithms.moral.moral_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.maximum_spanning_tree
    - networkx.algorithms.complete_to_chordal_graph
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.chordal.chordal_graph_cliques
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.moral.moral_graph
    functionSourceFile: networkx.algorithms.moral
    functionUses: 1
    functionsReached:
    - G.pred.values
    - G.to_undirected
    - itertools.combinations
    - H.add_edges_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.complete_to_chordal_graph
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: set_edge_0.isdisjoint
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: set_edge_0.intersection
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.maximum_spanning_tree
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: junction_tree.edges
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: junction_tree.add_node
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: junction_tree.add_edge
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: junction_tree.remove_edge
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.moral
    functionSourceFile: networkx.algorithms.moral
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.pred.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.graph_hashing
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.utils.not_implemented_for
    - networkx.contracted_edge
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - label
    - digest_size
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 16
    functionName: networkx.algorithms.graph_hashing._hash_label
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 4
    functionsReached:
    - hashlib.blake2b.hexdigest
    - hashlib.blake2b
    - label.encode
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: label.encode
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: hashlib.blake2b
    functionSourceFile: hashlib
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: hashlib.blake2b.hexdigest
    functionSourceFile: hashlib
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - edge_attr
    - node_attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 20
    functionName: networkx.algorithms.graph_hashing._init_node_labels
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 2
    functionsReached:
    - G.in_degree
    - G.nodes
    - G.out_degree
    - <builtin>.str
    - networkx.is_directed
    - warnings.warn
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_directed
    functionSourceFile: ''
    functionUses: 212
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3700>
    argNames:
    - G
    - node
    - node_labels
    - edge_attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 38
    functionName: networkx.algorithms.graph_hashing._neighborhood_aggregate_undirected
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 4
    functionsReached:
    - label_list.append
    - <builtin>.sorted
    - <builtin>.str
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: label_list.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3100>
    argNames:
    - G
    - node
    - node_labels
    - edge_attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 50
    functionName: networkx.algorithms.graph_hashing._neighborhood_aggregate_directed
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 4
    functionsReached:
    - G.successors
    - <builtin>.sorted
    - successor_labels.append
    - predecessor_labels.append
    - G.predecessors
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: successor_labels.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: predecessor_labels.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63df40>
    - <ast.Constant object at 0x7f734d63d520>
    - <ast.Constant object at 0x7f734d63d340>
    - <ast.Constant object at 0x7f734d63d6d0>
    argNames:
    - G
    - edge_attr
    - node_attr
    - iterations
    - digest_size
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 73
    functionName: networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 0
    functionsReached:
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_undirected
    - <builtin>.sorted
    - predecessor_labels.append
    - label.encode
    - <builtin>.str
    - networkx.is_directed
    - warnings.warn
    - successor_labels.append
    - networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.weisfeiler_lehman_step
    - subgraph_hash_counts.extend
    - label_list.append
    - G.predecessors
    - hashlib.blake2b
    - collections.Counter.items
    - G.in_degree
    - G.is_directed
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_directed
    - hashlib.blake2b.hexdigest
    - <builtin>.tuple
    - G.out_degree
    - networkx.algorithms.graph_hashing._hash_label
    - networkx.algorithms.graph_hashing._init_node_labels
    - collections.Counter
    - G.neighbors
    - <builtin>.range
    - node_labels.values
    - G.successors
    - G.nodes
    - G.degree
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcbd60>
    argNames:
    - G
    - labels
    - edge_attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 195
    functionName: networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.weisfeiler_lehman_step
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 1
    functionsReached:
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_directed
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_undirected
    - <builtin>.sorted
    - successor_labels.append
    - G.successors
    - hashlib.blake2b.hexdigest
    - G.nodes
    - label_list.append
    - predecessor_labels.append
    - label.encode
    - G.predecessors
    - <builtin>.str
    - hashlib.blake2b
    - networkx.algorithms.graph_hashing._hash_label
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_labels.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.<lambda1>
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: subgraph_hash_counts.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf82fd0>
    - <ast.Constant object at 0x7f734a9ed8e0>
    - <ast.Constant object at 0x7f734a9ed1c0>
    - <ast.Constant object at 0x7f734a9ed490>
    - <ast.Constant object at 0x7f734a9edb50>
    argNames:
    - G
    - edge_attr
    - node_attr
    - iterations
    - digest_size
    - include_initial_labels
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 231
    functionName: networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 0
    functionsReached:
    - node_labels.items
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_undirected
    - <builtin>.sorted
    - predecessor_labels.append
    - label.encode
    - <builtin>.str
    - networkx.is_directed
    - warnings.warn
    - successor_labels.append
    - label_list.append
    - G.predecessors
    - hashlib.blake2b
    - G.in_degree
    - G.is_directed
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_directed
    - hashlib.blake2b.hexdigest
    - G.out_degree
    - networkx.algorithms.graph_hashing._hash_label
    - networkx.algorithms.graph_hashing._init_node_labels
    - G.neighbors
    - collections.defaultdict
    - <builtin>.range
    - G.successors
    - G.nodes
    - <builtin>.dict
    - networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.weisfeiler_lehman_step
    - G.degree
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc7a60>
    argNames:
    - G
    - labels
    - node_subgraph_hashes
    - edge_attr
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 394
    functionName: networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.weisfeiler_lehman_step
    functionSourceFile: networkx.algorithms.graph_hashing
    functionUses: 1
    functionsReached:
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_directed
    - networkx.algorithms.graph_hashing._neighborhood_aggregate_undirected
    - <builtin>.sorted
    - successor_labels.append
    - G.successors
    - hashlib.blake2b.hexdigest
    - G.nodes
    - label_list.append
    - predecessor_labels.append
    - label.encode
    - G.predecessors
    - <builtin>.str
    - hashlib.blake2b
    - networkx.algorithms.graph_hashing._hash_label
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_labels.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.d_separation
    functionSourceFile: networkx.algorithms.d_separation
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_directed_acyclic_graph
    functionSourceFile: ''
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.ancestors
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: backward_visited.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: forward_visited.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodeset.union
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - x
    - a
    - z
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 589
    functionName: networkx.algorithms.d_separation._reachable
    functionSourceFile: networkx.algorithms.d_separation
    functionUses: 192
    functionsReached:
    - collections.deque.append
    - processed.append
    - <builtin>.any
    - collections.deque.popleft
    - networkx.algorithms.d_separation._reachable._pass
    - collections.deque
    - collections.deque.copy
    - itertools.chain
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.intersection
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: y.intersection
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - e
    - v
    - f
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 627
    functionName: networkx.algorithms.d_separation._reachable._pass
    functionSourceFile: networkx.algorithms.d_separation
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.deque.copy
    functionSourceFile: collections
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: processed.append
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation
    functionSourceFile: networkx.algorithms.approximation
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.treewidth
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 45
    functionName: networkx.algorithms.approximation.treewidth.treewidth_min_degree
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - heapq.heappop
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.algorithms.approximation.treewidth.min_fill_in_heuristic
    - <builtin>.set
    - node_stack.pop
    - <builtin>.next
    - <builtin>.frozenset
    - graph_dict.keys
    - attr_dict.update
    - networkx.algorithms.approximation.treewidth.treewidth_decomp
    - networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.__init__
    - nbrs.add
    - itertools.count
    - heapq.heappush
    - heapq.heapify
    - node_stack.append
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.approximation.treewidth.treewidth_min_degree.<lambda1>
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.best_node
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 97
    functionName: networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.__init__
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 1
    functionsReached:
    - <builtin>.len
    - <builtin>.next
    - heapq.heapify
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.treewidth.treewidth_min_degree.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 3
    functionsReached:
    - heapq.heappop
    - networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.best_node
    - <builtin>.len
    - heapq.heappush
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 111
    functionName: networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.best_node
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 4
    functionsReached:
    - <builtin>.len
    - <builtin>.next
    - heapq.heappop
    - heapq.heappush
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Name object at 0x7f734cbb6d00>
    argNames:
    - G
    - heuristic
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 184
    functionName: networkx.algorithms.approximation.treewidth.treewidth_decomp
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - heapq.heappop
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.algorithms.approximation.treewidth.min_fill_in_heuristic
    - <builtin>.set
    - node_stack.pop
    - <builtin>.next
    - <builtin>.frozenset
    - graph_dict.keys
    - attr_dict.update
    - nbrs.add
    - heapq.heappush
    - node_stack.append
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.approximation.treewidth.treewidth_min_degree.<lambda1>
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.best_node
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 69
    functionName: networkx.algorithms.approximation.treewidth.treewidth_min_fill_in
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - heapq.heappop
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.algorithms.approximation.treewidth.min_fill_in_heuristic
    - <builtin>.set
    - node_stack.pop
    - <builtin>.next
    - <builtin>.frozenset
    - graph_dict.keys
    - attr_dict.update
    - networkx.algorithms.approximation.treewidth.treewidth_decomp
    - nbrs.add
    - heapq.heappush
    - node_stack.append
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.approximation.treewidth.treewidth_min_degree.<lambda1>
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.best_node
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph_dict
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 135
    functionName: networkx.algorithms.approximation.treewidth.min_fill_in_heuristic
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 3
    functionsReached:
    - <builtin>.len
    - <builtin>.sorted
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.treewidth.min_fill_in_heuristic.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.treewidth
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.permutations
    functionSourceFile: itertools
    functionUses: 226
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_stack.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_dict.keys
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_stack.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrs.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.dominating_set
    functionSourceFile: networkx.algorithms.approximation.dominating_set
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b7839d0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 25
    functionName: networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set
    functionSourceFile: networkx.algorithms.approximation.dominating_set
    functionUses: 0
    functionsReached:
    - dom_set.add
    - neighborhoods.items
    - <builtin>.min
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - node_and_neighborhood
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set._cost
    functionSourceFile: networkx.algorithms.approximation.dominating_set
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neighborhoods.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dom_set.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matching.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - matching
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 60
    functionName: networkx.algorithms.matching.matching_dict_to_set
    functionSourceFile: networkx.algorithms.matching
    functionUses: 195
    functionsReached:
    - edges.add
    - matching.items
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matching.items
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.add
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccd6190>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 263
    functionName: networkx.algorithms.matching.min_weight_matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 0
    functionsReached:
    - networkx.algorithms.matching.max_weight_matching.Blossom.leaves
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.matching.max_weight_matching.verifyOptimum
    - bestedge.pop
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - iblossoms.reverse
    - mate.get
    - nbrs.items
    - blossomdual.keys
    - blossomdual.values
    - path.reverse
    - <builtin>.str
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom._recurse
    - itertools.repeat
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.matching.max_weight_matching.slack
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.max
    - stack.pop
    - <builtin>.type
    - <builtin>.len
    - jblossoms.reverse
    - <builtin>.set
    - label.pop
    - networkx.algorithms.matching.matching_dict_to_set
    - label.clear
    - edgs.reverse
    - jblossoms.append
    - networkx.algorithms.matching.max_weight_matching
    - matching.items
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom
    - stack.append
    - bv.leaves
    - networkx.algorithms.matching.max_weight_matching.scanBlossom
    - <builtin>.hasattr
    - networkx.algorithms.matching.max_weight_matching.expandBlossom._recurse
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - iblossoms.append
    - dualvar.values
    - <builtin>.isinstance
    - queue.pop
    - s.leaves
    - networkx.algorithms.matching.max_weight_matching.expandBlossom
    - networkx.algorithms.matching.max_weight_matching.assignLabel
    - b.childs.index
    - stack.extend
    - edgs.append
    - edges.add
    - d.get
    - bestedge.clear
    - networkx.algorithms.matching.max_weight_matching.addBlossom
    - labeledge.clear
    - bestedgeto.values
    - path.append
    - labeledge.pop
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - allowedge.clear
    - <builtin>.dict
    - bestedge.get
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - b.leaves
    - label.get
    - networkx.algorithms.matching.max_weight_matching.augmentMatching
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 38
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 18
    EdgeCount: 54
    ICount: 14
    IfCount: 38
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b9e1bb0>
    - <ast.Constant object at 0x7f734b9e1fd0>
    argNames:
    - G
    - maxcardinality
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 321
    functionName: networkx.algorithms.matching.max_weight_matching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 1
    functionsReached:
    - networkx.algorithms.matching.max_weight_matching.Blossom.leaves
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.matching.max_weight_matching.verifyOptimum
    - bestedge.pop
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - iblossoms.reverse
    - mate.get
    - nbrs.items
    - blossomdual.keys
    - blossomdual.values
    - path.reverse
    - <builtin>.str
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom._recurse
    - itertools.repeat
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.matching.max_weight_matching.slack
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.max
    - stack.pop
    - <builtin>.type
    - <builtin>.len
    - jblossoms.reverse
    - <builtin>.set
    - label.pop
    - networkx.algorithms.matching.matching_dict_to_set
    - label.clear
    - edgs.reverse
    - jblossoms.append
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom
    - matching.items
    - stack.append
    - bv.leaves
    - networkx.algorithms.matching.max_weight_matching.scanBlossom
    - <builtin>.hasattr
    - networkx.algorithms.matching.max_weight_matching.expandBlossom._recurse
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - iblossoms.append
    - dualvar.values
    - <builtin>.isinstance
    - queue.pop
    - s.leaves
    - networkx.algorithms.matching.max_weight_matching.expandBlossom
    - networkx.algorithms.matching.max_weight_matching.assignLabel
    - b.childs.index
    - stack.extend
    - edgs.append
    - edges.add
    - d.get
    - bestedge.clear
    - networkx.algorithms.matching.max_weight_matching.addBlossom
    - labeledge.clear
    - bestedgeto.values
    - path.append
    - labeledge.pop
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - allowedge.clear
    - <builtin>.dict
    - bestedge.get
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - b.leaves
    - label.get
    - networkx.algorithms.matching.max_weight_matching.augmentMatching
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 415
    functionName: networkx.algorithms.matching.max_weight_matching.Blossom.leaves
    functionSourceFile: networkx.algorithms.matching
    functionUses: 3
    functionsReached:
    - <builtin>.isinstance
    - stack.pop
    - stack.extend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: stack.extend
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.repeat
    functionSourceFile: itertools
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - v
    - w
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 508
    functionName: networkx.algorithms.matching.max_weight_matching.slack
    functionSourceFile: networkx.algorithms.matching
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - w
    - t
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 513
    functionName: networkx.algorithms.matching.max_weight_matching.assignLabel
    functionSourceFile: networkx.algorithms.matching
    functionUses: 4
    functionsReached:
    - queue.extend
    - queue.append
    - <builtin>.isinstance
    - b.leaves
    - label.get
    - networkx.algorithms.matching.max_weight_matching.assignLabel
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: label.get
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: b.leaves
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.extend
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - v
    - w
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 538
    functionName: networkx.algorithms.matching.max_weight_matching.scanBlossom
    functionSourceFile: networkx.algorithms.matching
    functionUses: 2
    functionsReached:
    - path.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 8
    IfCount: 6
    argCount: 3
    argDefaultValues: []
    argNames:
    - base
    - v
    - w
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 575
    functionName: networkx.algorithms.matching.max_weight_matching.addBlossom
    functionSourceFile: networkx.algorithms.matching
    functionUses: 2
    functionsReached:
    - bv.leaves
    - edgs.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.matching.max_weight_matching.slack
    - networkx.algorithms.matching.max_weight_matching.Blossom.leaves
    - queue.append
    - path.append
    - bestedgeto.values
    - stack.pop
    - path.reverse
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - <builtin>.set
    - edgs.reverse
    - <builtin>.isinstance
    - label.get
    - stack.extend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgs.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgs.reverse
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bv.leaves
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 237
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 209
    functionsReached:
    - <builtin>.iter
    - <builtin>.set
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bestedgeto.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - endstage
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 670
    functionName: networkx.algorithms.matching.max_weight_matching.expandBlossom
    functionSourceFile: networkx.algorithms.matching
    functionUses: 2
    functionsReached:
    - stack.append
    - bv.leaves
    - queue.extend
    - networkx.algorithms.matching.max_weight_matching.expandBlossom._recurse
    - queue.append
    - bestedge.pop
    - labeledge.pop
    - <builtin>.len
    - label.pop
    - <builtin>.isinstance
    - s.leaves
    - b.leaves
    - label.get
    - networkx.algorithms.matching.max_weight_matching.assignLabel
    - b.childs.index
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 6
    IfCount: 10
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - endstage
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 676
    functionName: networkx.algorithms.matching.max_weight_matching.expandBlossom._recurse
    functionSourceFile: networkx.algorithms.matching
    functionUses: 3
    functionsReached:
    - bv.leaves
    - queue.extend
    - queue.append
    - bestedge.pop
    - labeledge.pop
    - <builtin>.len
    - label.pop
    - <builtin>.isinstance
    - s.leaves
    - b.leaves
    - label.get
    - networkx.algorithms.matching.max_weight_matching.assignLabel
    - b.childs.index
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: s.leaves
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: b.childs.index
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: label.pop
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: labeledge.pop
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bestedge.pop
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 786
    functionName: networkx.algorithms.matching.max_weight_matching.augmentBlossom
    functionSourceFile: networkx.algorithms.matching
    functionUses: 3
    functionsReached:
    - stack.append
    - <builtin>.len
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom._recurse
    - <builtin>.isinstance
    - b.childs.index
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 792
    functionName: networkx.algorithms.matching.max_weight_matching.augmentBlossom._recurse
    functionSourceFile: networkx.algorithms.matching
    functionUses: 4
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - b.childs.index
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - v
    - w
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 851
    functionName: networkx.algorithms.matching.max_weight_matching.augmentMatching
    functionSourceFile: networkx.algorithms.matching
    functionUses: 2
    functionsReached:
    - stack.append
    - <builtin>.len
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom._recurse
    - networkx.algorithms.matching.max_weight_matching.augmentBlossom
    - <builtin>.isinstance
    - b.childs.index
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 884
    functionName: networkx.algorithms.matching.max_weight_matching.verifyOptimum
    functionSourceFile: networkx.algorithms.matching
    functionUses: 2
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - d.get
    - <builtin>.zip
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.min
    - iblossoms.reverse
    - mate.get
    - <builtin>.len
    - blossomdual.values
    - jblossoms.reverse
    - iblossoms.append
    - nbrs.items
    - jblossoms.append
    - dualvar.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dualvar.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: blossomdual.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: iblossoms.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: jblossoms.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: iblossoms.reverse
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: jblossoms.reverse
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mate.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: label.clear
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: labeledge.clear
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bestedge.clear
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: allowedge.clear
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bestedge.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: blossomdual.keys
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.connectivity
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e3a0>
    argNames:
    - G
    - source
    - target
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 16
    functionName: networkx.algorithms.approximation.connectivity.local_node_connectivity
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 3
    functionsReached:
    - G.is_directed
    - <builtin>.range
    - networkx.algorithms.approximation.connectivity._bidirectional_shortest_path
    - path.append
    - G.out_degree
    - <builtin>.min
    - path.reverse
    - forward_fringe.append
    - <builtin>.set
    - reverse_fringe.append
    - <builtin>.float
    - G.degree
    - networkx.algorithms.approximation.connectivity._bidirectional_pred_succ
    - G.in_degree
    - exclude.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - source
    - target
    - exclude
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 297
    functionName: networkx.algorithms.approximation.connectivity._bidirectional_shortest_path
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 4
    functionsReached:
    - G.is_directed
    - path.append
    - path.reverse
    - reverse_fringe.append
    - networkx.algorithms.approximation.connectivity._bidirectional_pred_succ
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: exclude.update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b101d90>
    - <ast.Constant object at 0x7f734b101ca0>
    argNames:
    - G
    - s
    - t
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 112
    functionName: networkx.algorithms.approximation.connectivity.node_connectivity
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.approximation.connectivity._bidirectional_shortest_path
    - itertools.permutations
    - path.reverse
    - networkx.algorithms.components.connected._plain_bfs
    - seen.add
    - nextlevel.append
    - forward_fringe.append
    - networkx.algorithms.approximation.connectivity.local_node_connectivity
    - G.predecessors
    - <builtin>.len
    - operator.itemgetter
    - <builtin>.set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - networkx.algorithms.approximation.connectivity._bidirectional_pred_succ
    - <builtin>.next
    - G.in_degree
    - itertools.chain
    - G.is_directed
    - G.out_degree
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - <builtin>.iter
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - <builtin>.float
    - exclude.update
    - <builtin>.range
    - G.successors
    - networkx.algorithms.components.connected.connected_components
    - path.append
    - <builtin>.min
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - G.degree
    - reverse_fringe.append
    - networkx.algorithms.approximation.connectivity.node_connectivity.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 191
    functionName: networkx.algorithms.approximation.connectivity.node_connectivity.neighbors
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 1
    functionsReached:
    - G.predecessors
    - G.successors
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a5bbb20>
    - <ast.Constant object at 0x7f734a5bb5e0>
    argNames:
    - G
    - nbunch
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 218
    functionName: networkx.algorithms.approximation.connectivity.all_pairs_node_connectivity
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.algorithms.approximation.connectivity.local_node_connectivity
    - <builtin>.range
    - networkx.algorithms.approximation.connectivity._bidirectional_shortest_path
    - exclude.update
    - path.append
    - itertools.permutations
    - G.out_degree
    - <builtin>.min
    - path.reverse
    - itertools.combinations
    - <builtin>.set
    - reverse_fringe.append
    - <builtin>.float
    - G.degree
    - networkx.algorithms.approximation.connectivity._bidirectional_pred_succ
    - G.in_degree
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 2
    IfCount: 8
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - source
    - target
    - exclude
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 360
    functionName: networkx.algorithms.approximation.connectivity._bidirectional_pred_succ
    functionSourceFile: networkx.algorithms.approximation.connectivity
    functionUses: 5
    functionsReached:
    - G.is_directed
    - reverse_fringe.append
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: forward_fringe.append
    functionSourceFile: <builtin>
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: reverse_fringe.append
    functionSourceFile: <builtin>
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.clustering_coefficient
    functionSourceFile: networkx.algorithms.approximation.clustering_coefficient
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cce8dc0>
    - <ast.Constant object at 0x7f734cce8760>
    argNames:
    - G
    - trials
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 10
    functionName: networkx.algorithms.approximation.clustering_coefficient.average_clustering
    functionSourceFile: networkx.algorithms.approximation.clustering_coefficient
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.random
    - <builtin>.int
    - seed.sample
    - <builtin>.list
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.sample
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.ramsey
    functionSourceFile: networkx.algorithms.approximation.ramsey
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_neighbors
    functionSourceFile: ''
    functionUses: 209
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.non_neighbors
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: c_1.add
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: i_2.add
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.clique
    functionSourceFile: networkx.algorithms.approximation.clique
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.complement
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cliques.append
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: isets.append
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - U
    - size
    - best_size
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 246
    functionName: networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    functionSourceFile: networkx.algorithms.approximation.clique
    functionUses: 191
    functionsReached:
    - <builtin>.max
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - U.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: U.remove
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.maxcut
    functionSourceFile: networkx.algorithms.approximation.maxcut
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a80d0>
    - <ast.Constant object at 0x7f734b6a8400>
    - <ast.Constant object at 0x7f734b6a8520>
    argNames:
    - G
    - seed
    - p
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.algorithms.approximation.maxcut.randomized_partitioning
    functionSourceFile: networkx.algorithms.approximation.maxcut
    functionUses: 0
    functionsReached:
    - G.nodes
    - seed.random
    - networkx.algorithms.cut_size
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.cut_size
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - cut
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 63
    functionName: networkx.algorithms.approximation.maxcut._swap_node_partition
    functionSourceFile: networkx.algorithms.approximation.maxcut
    functionUses: 2
    functionsReached:
    - cut.union
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cut.union
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66ec10>
    - <ast.Constant object at 0x7f734b66eb50>
    - <ast.Constant object at 0x7f734b66e8b0>
    argNames:
    - G
    - initial_cut
    - seed
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 71
    functionName: networkx.algorithms.approximation.maxcut.one_exchange
    functionSourceFile: networkx.algorithms.approximation.maxcut
    functionUses: 0
    functionsReached:
    - cut.union
    - networkx.algorithms.cut_size
    - <builtin>.max
    - G.nodes
    - <builtin>.list
    - <builtin>.set
    - networkx.algorithms.approximation.maxcut._swap_node_partition
    - seed.shuffle
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.shuffle
    functionSourceFile: <builtin>
    functionUses: 209
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.maxcut.one_exchange.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.maxcut
    functionUses: 0
    functionsReached:
    - cut.union
    - networkx.algorithms.approximation.maxcut._swap_node_partition
    - networkx.algorithms.cut_size
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.density
    functionSourceFile: networkx.algorithms.approximation.density
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.not_implemented_for
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - iterations
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 10
    functionName: networkx.algorithms.approximation.density._greedy_plus_plus
    functionSourceFile: networkx.algorithms.approximation.density
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.utils.heaps.BinaryHeap.pop
    - heapq.heappop
    - G.number_of_edges
    - <builtin>.dict
    - networkx.utils.heaps.BinaryHeap.insert
    - <builtin>.len
    - <builtin>.set
    - remaining_nodes.remove
    - heapq.heappush
    - <builtin>.next
    - G.neighbors
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: remaining_nodes.remove
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - G
    - b
    - x
    - node_to_idx
    - edge_to_idx
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 66
    functionName: networkx.algorithms.approximation.density._fractional_peeling
    functionSourceFile: networkx.algorithms.approximation.density
    functionUses: 192
    functionsReached:
    - networkx.utils.heaps.BinaryHeap.pop
    - heapq.heappop
    - G.number_of_edges
    - <builtin>.len
    - networkx.utils.heaps.BinaryHeap.insert
    - remaining_nodes.remove
    - <builtin>.set
    - <builtin>.enumerate
    - heapq.heappush
    - <builtin>.next
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - iterations
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 130
    functionName: networkx.algorithms.approximation.density._fista
    functionSourceFile: networkx.algorithms.approximation.density
    functionUses: 191
    functionsReached:
    - heapq.heappop
    - G.number_of_nodes
    - G.number_of_edges
    - remaining_nodes.remove
    - <builtin>.enumerate
    - numpy.empty
    - numpy.full
    - math.sqrt
    - numpy.clip
    - networkx.algorithms.approximation.density._fractional_peeling
    - <builtin>.max
    - numpy.array
    - <builtin>.len
    - numpy.add.at
    - <builtin>.set
    - <builtin>.next
    - networkx.utils.heaps.BinaryHeap.pop
    - x.copy
    - networkx.utils.heaps.BinaryHeap.insert
    - heapq.heappush
    - G.neighbors
    - <builtin>.range
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.empty
    functionSourceFile: numpy
    functionUses: 204
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.copy
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.sqrt
    functionSourceFile: math
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.vertex_cover
    functionSourceFile: networkx.algorithms.approximation.vertex_cover
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b691610>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 17
    functionName: networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover
    functionSourceFile: networkx.algorithms.approximation.vertex_cover
    functionUses: 0
    functionsReached:
    - cover.add
    - G.nodes
    - <builtin>.dict
    - <builtin>.set
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cover.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.traveling_salesman
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - soln
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 53
    functionName: networkx.algorithms.approximation.traveling_salesman.swap_two_nodes
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - <builtin>.range
    - seed.sample
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - soln
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 88
    functionName: networkx.algorithms.approximation.traveling_salesman.move_one_node
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 2
    functionsReached:
    - soln.insert
    - <builtin>.range
    - seed.sample
    - <builtin>.len
    - soln.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: soln.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: soln.insert
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7344457910>
    - <ast.Constant object at 0x7f73444578e0>
    argNames:
    - G
    - weight
    - tree
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 129
    functionName: networkx.algorithms.approximation.traveling_salesman.christofides
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 1
    functionsReached:
    - G.graph.update
    - networkx.classes.digraph.DiGraph.remove_nodes_from
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - keydict.items
    - keydict.get
    - networkx.minimum_spanning_tree
    - keylist.append
    - networkx.eulerian_circuit
    - <builtin>.any
    - networkx.algorithms.approximation.traveling_salesman._shortcutting
    - networkx.min_weight_matching
    - nodes.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.nodes_with_selfloops
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - d.copy
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.abc.Mapping.items
    - datadict.copy
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.super
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.nodes_with_selfloops
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1199
    functionName: networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 234
    functionsReached:
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.minimum_spanning_tree
    functionSourceFile: ''
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 957
    functionName: networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 4
    functionsReached:
    - networkx._clear_cache
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.min_weight_matching
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.eulerian_circuit
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - circuit
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 188
    functionName: networkx.algorithms.approximation.traveling_salesman._shortcutting
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 3
    functionsReached:
    - nodes.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 4
    IfCount: 7
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e220>
    - <ast.Constant object at 0x7f734c43e8b0>
    - <ast.Constant object at 0x7f734c43e790>
    - <ast.Constant object at 0x7f734c43ea00>
    argNames:
    - G
    - weight
    - nodes
    - cycle
    - method
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 202
    functionName: networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached:
    - numpy.linalg.det
    - p1_mst.size
    - queue.PriorityQueue.put
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - <builtin>.zip
    - networkx.is_strongly_connected
    - nbrs.items
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - networkx.minimum_spanning_tree
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.approximation.traveling_salesman._shortcutting
    - numpy.full
    - nodes.append
    - dir_ascent.items
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - networkx.algorithms.tree.mst.number_of_spanning_trees
    - arb.copy
    - queue.PriorityQueue
    - networkx.number_of_spanning_trees
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - <builtin>.float
    - best_path.extend
    - flow_dict.items
    - d.get
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - math.log
    - minimum_1_arborescences.add
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.all_pairs_dijkstra
    - queue.PriorityQueue.empty
    - k.size
    - scipy.optimize.linprog
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - keydict.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - keylist.append
    - networkx.is_directed
    - arb.add_edge
    - networkx.utils.misc.pairwise
    - new_arb.add_edge
    - networkx.min_weight_matching
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.laplacian_matrix
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - V.remove
    - k.degree
    - networkx.algorithms.tree.mst.random_spanning_tree.find_node
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.classes.graph.Graph.remove_node
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent
    - <builtin>.iter
    - networkx.is_weakly_connected
    - p2.partition_dict.copy
    - <builtin>.isinstance
    - k.remove_edge
    - networkx.algorithms.tree.mst.random_spanning_tree.prepare_graph
    - networkx.contracted_edge
    - datadict.copy
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.contracted_nodes
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - G.graph.update
    - networkx.classes.digraph.DiGraph.remove_nodes_from
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - k.in_edges
    - seed.uniform
    - <builtin>.sum
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__
    - networkx.set_node_attributes
    - numpy.empty
    - math.exp
    - itertools.pairwise
    - G.add_edges_from
    - networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - networkx.is_connected
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - k.in_degree
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.approximation.traveling_salesman.asadpour_atsp
    - math.ceil
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - G.edges
    - seed.shuffle
    - <builtin>.range
    - k.edges
    - <builtin>.round
    - queue.PriorityQueue.get
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - k.add_edge
    - networkx.algorithms.tree.mst.random_spanning_tree
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__next__
    - collections.abc.Mapping.items
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.min_cost_flow
    - numpy.zeros
    - networkx.algorithms.tree.mst.random_spanning_tree.spanning_tree_total_weight
    - best_GG.index
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - best_path.append
    - networkx.algorithms.approximation.traveling_salesman.christofides
    - <builtin>.enumerate
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.direction_of_ascent
    - networkx.eulerian_circuit
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.diag
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.nodes_with_selfloops
    - partition.partition_dict.copy
    - networkx.adjacency_matrix
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - arb.size
    - itertools.chain
    - d.popitem
    - <builtin>.list
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.find_epsilon
    - k_max.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    - k.number_of_edges
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.classes.graph.Graph.order
    - networkx.freeze
    - minimum_1_arborescences.clear
    - networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from
    - networkx.set_edge_attributes
    - itertools.tee
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_dijkstra
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 7
    IfCount: 10
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a8b0>
    - <ast.Constant object at 0x7f734b77a3a0>
    - <ast.Constant object at 0x7f734b77ad30>
    argNames:
    - G
    - weight
    - seed
    - source
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 361
    functionName: networkx.algorithms.approximation.traveling_salesman.asadpour_atsp
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 1
    functionsReached:
    - numpy.linalg.det
    - p1_mst.size
    - queue.PriorityQueue.put
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - nbrs.items
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - <builtin>.any
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.traveling_salesman._shortcutting
    - dir_ascent.items
    - nodes.append
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - networkx.algorithms.tree.mst.number_of_spanning_trees
    - arb.copy
    - queue.PriorityQueue
    - networkx.number_of_spanning_trees
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi
    - networkx.classes.multigraph.MultiGraph.copy
    - <builtin>.float
    - flow_dict.items
    - d.get
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - math.log
    - minimum_1_arborescences.add
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - queue.PriorityQueue.empty
    - k.size
    - scipy.optimize.linprog
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - keydict.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - keylist.append
    - networkx.is_directed
    - arb.add_edge
    - new_arb.add_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.laplacian_matrix
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - V.remove
    - k.degree
    - networkx.algorithms.tree.mst.random_spanning_tree.find_node
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.classes.graph.Graph.remove_node
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent
    - <builtin>.iter
    - networkx.is_weakly_connected
    - p2.partition_dict.copy
    - <builtin>.isinstance
    - k.remove_edge
    - networkx.algorithms.tree.mst.random_spanning_tree.prepare_graph
    - networkx.contracted_edge
    - datadict.copy
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.contracted_nodes
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - k.in_edges
    - seed.uniform
    - <builtin>.sum
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__
    - networkx.set_node_attributes
    - numpy.empty
    - math.exp
    - G.add_edges_from
    - networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - networkx.is_connected
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - k.in_degree
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - math.ceil
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - seed.shuffle
    - G.edges
    - <builtin>.range
    - k.edges
    - <builtin>.round
    - queue.PriorityQueue.get
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - k.add_edge
    - networkx.algorithms.tree.mst.random_spanning_tree
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__next__
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.min_cost_flow
    - numpy.zeros
    - networkx.algorithms.tree.mst.random_spanning_tree.spanning_tree_total_weight
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - <builtin>.enumerate
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.direction_of_ascent
    - networkx.eulerian_circuit
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.diag
    - partition.partition_dict.copy
    - networkx.adjacency_matrix
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - arb.size
    - d.popitem
    - <builtin>.list
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.find_epsilon
    - k_max.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    - k.number_of_edges
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.classes.graph.Graph.order
    - networkx.freeze
    - minimum_1_arborescences.clear
    - networkx.set_edge_attributes
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: best_GG.index
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: best_path.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: best_path.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb6400>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 520
    functionName: networkx.algorithms.approximation.traveling_salesman.held_karp_ascent
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 2
    functionsReached:
    - p1_mst.size
    - queue.PriorityQueue.put
    - nbrs.items
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - numpy.full
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - dir_ascent.items
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - collections.abc.Mapping.keys
    - <builtin>.max
    - arb.copy
    - queue.PriorityQueue
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi
    - networkx.classes.multigraph.MultiGraph.copy
    - d.get
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - minimum_1_arborescences.add
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - queue.PriorityQueue.empty
    - k.size
    - scipy.optimize.linprog
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - keydict.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - arb.add_edge
    - new_arb.add_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - k.degree
    - <builtin>.hasattr
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.iter
    - networkx.is_weakly_connected
    - p2.partition_dict.copy
    - k.remove_edge
    - datadict.copy
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - G.graph.update
    - G.__class__
    - k.in_edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__
    - numpy.empty
    - G.add_edges_from
    - networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - k.in_degree
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - k.edges
    - queue.PriorityQueue.get
    - k.add_edge
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__next__
    - networkx.empty_graph
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.remove_node
    - numpy.zeros
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - <builtin>.enumerate
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.direction_of_ascent
    - networkx.classes.reportviews.OutEdgeView.__init__
    - partition.partition_dict.copy
    - <builtin>.next
    - arb.size
    - d.popitem
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.find_epsilon
    - <builtin>.list
    - k_max.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    - k.number_of_edges
    - networkx.classes.graph.Graph.order
    - networkx.freeze
    - minimum_1_arborescences.clear
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.exp
    functionSourceFile: math
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.ceil
    functionSourceFile: math
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16dc0>
    argNames:
    - G
    - weight
    - multiplicative
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 747
    functionName: networkx.algorithms.tree.mst.random_spanning_tree
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 2
    functionsReached:
    - numpy.linalg.det
    - networkx.algorithms.tree.mst.random_spanning_tree.spanning_tree_total_weight
    - seed.uniform
    - G.number_of_edges
    - A.sum
    - keydict.get
    - keylist.append
    - networkx.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.diag
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - networkx.adjacency_matrix
    - <builtin>.set
    - networkx.algorithms.tree.mst.number_of_spanning_trees
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - V.remove
    - networkx.algorithms.tree.mst.random_spanning_tree.find_node
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.number_of_spanning_trees
    - <builtin>.hasattr
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - <builtin>.list
    - networkx.is_weakly_connected
    - <builtin>.float
    - seed.shuffle
    - G.edges
    - networkx.algorithms.tree.mst.random_spanning_tree.prepare_graph
    - networkx.contracted_edge
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.contracted_nodes
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - Exception
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.min_cost_flow
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: flow_dict.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 8
    IfCount: 7
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 568
    functionName: networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 4
    functionsReached:
    - p1_mst.size
    - G.graph.update
    - queue.PriorityQueue.put
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - nbrs.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - keydict.items
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - arb.add_edge
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - new_arb.add_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - G.add_edges_from
    - datadict.update
    - networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - partition.partition_dict.copy
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - arb.copy
    - <builtin>.next
    - queue.PriorityQueue
    - arb.size
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - d.popitem
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - <builtin>.iter
    - p2.partition_dict.copy
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - networkx.classes.reportviews.InEdgeView.__init__
    - d.copy
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    - collections.abc.Mapping.items
    - queue.PriorityQueue.get
    - datadict.copy
    - d.get
    - networkx.freeze
    - minimum_1_arborescences.clear
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - minimum_1_arborescences.add
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__next__
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - queue.PriorityQueue.empty
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arb.size
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arb.add_edge
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi.<lambda2>
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: arb.copy
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_arb.add_edge
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: minimum_1_arborescences.clear
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: minimum_1_arborescences.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 652
    functionName: networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.direction_of_ascent
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 3
    functionsReached:
    - p1_mst.size
    - queue.PriorityQueue.put
    - nbrs.items
    - networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition
    - numpy.full
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - collections.abc.Mapping.keys
    - arb.copy
    - queue.PriorityQueue
    - networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi
    - networkx.classes.multigraph.MultiGraph.copy
    - d.get
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - minimum_1_arborescences.add
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - queue.PriorityQueue.empty
    - scipy.optimize.linprog
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - keydict.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - arb.add_edge
    - new_arb.add_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - <builtin>.iter
    - p2.partition_dict.copy
    - datadict.copy
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    - G.graph.update
    - G.__class__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__
    - numpy.empty
    - G.add_edges_from
    - networkx.algorithms.tree.branchings.ArborescenceIterator._partition
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - queue.PriorityQueue.get
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.tree.branchings.ArborescenceIterator.__next__
    - collections.abc.Mapping.items
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.remove_node
    - numpy.zeros
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - <builtin>.enumerate
    - networkx.classes.reportviews.OutEdgeView.__init__
    - partition.partition_dict.copy
    - <builtin>.next
    - arb.size
    - d.popitem
    - <builtin>.list
    - networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition
    - networkx.freeze
    - minimum_1_arborescences.clear
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.optimize.linprog
    functionSourceFile: scipy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 7
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - k
    - d
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 720
    functionName: networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.find_epsilon
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 3
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - k.add_edge
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - k.in_edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - k.in_degree
    - <builtin>.len
    - networkx.is_weakly_connected
    - k.remove_edge
    - <builtin>.next
    - k.number_of_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.in_edges
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.add_edge
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.remove_edge
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.in_degree
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dir_ascent.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.degree
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.size
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k.edges
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k_max.__iter__
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - e
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 866
    functionName: networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 193
    functionsReached:
    - networkx.contracted_edge
    - math.exp
    - <builtin>.hasattr
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - networkx.number_of_spanning_trees
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_of_spanning_trees
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7349ec0730>
    - <ast.Constant object at 0x7f7349ec0760>
    argNames:
    - G
    - weight
    - source
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 946
    functionName: networkx.algorithms.approximation.traveling_salesman.greedy_tsp
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 2
    functionsReached:
    - networkx.utils.arbitrary_element
    - G.adj.items
    - G.number_of_nodes
    - <builtin>.min
    - <builtin>.len
    - <builtin>.set
    - G.neighbors
    - <builtin>.next
    - nodeset.remove
    - cycle.append
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.adj.items
    functionSourceFile: <builtin>
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodeset.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.traveling_salesman.greedy_tsp.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cycle.append
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 1
    IfCount: 13
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f7347aec400>
    - <ast.Constant object at 0x7f7347aec430>
    - <ast.Constant object at 0x7f7347aec460>
    - <ast.Constant object at 0x7f7347aec490>
    - <ast.Constant object at 0x7f7347aec4c0>
    - <ast.Constant object at 0x7f7347aec4f0>
    - <ast.Constant object at 0x7f7347aec520>
    - <ast.Constant object at 0x7f7347aec550>
    argNames:
    - G
    - init_cycle
    - weight
    - source
    - temp
    - move
    - max_iterations
    - N_inner
    - alpha
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1050
    functionName: networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached:
    - soln.insert
    - seed.random
    - networkx.algorithms.approximation.traveling_salesman.swap_two_nodes
    - <builtin>.zip
    - seed.sample
    - G.number_of_nodes
    - networkx.algorithms.approximation.traveling_salesman.greedy_tsp
    - <builtin>.sum
    - soln.pop
    - networkx.utils.misc.pairwise
    - cycle.append
    - <builtin>.any
    - math.exp
    - itertools.pairwise
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - nodeset.remove
    - itertools.chain
    - cycle.copy
    - G.adj.items
    - <builtin>.list
    - networkx.algorithms.approximation.traveling_salesman.move_one_node
    - G.neighbors
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - <builtin>.min
    - itertools.tee
    - G.nbunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cycle.copy
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 1
    IfCount: 13
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f73478671c0>
    - <ast.Constant object at 0x7f73478671f0>
    - <ast.Constant object at 0x7f7347867220>
    - <ast.Constant object at 0x7f7347867250>
    - <ast.Constant object at 0x7f7347867280>
    - <ast.Constant object at 0x7f73478672b0>
    - <ast.Constant object at 0x7f73478672e0>
    - <ast.Constant object at 0x7f7347867310>
    argNames:
    - G
    - init_cycle
    - weight
    - source
    - threshold
    - move
    - max_iterations
    - N_inner
    - alpha
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1280
    functionName: networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp
    functionSourceFile: networkx.algorithms.approximation.traveling_salesman
    functionUses: 0
    functionsReached:
    - soln.insert
    - networkx.algorithms.approximation.traveling_salesman.swap_two_nodes
    - <builtin>.zip
    - seed.sample
    - G.number_of_nodes
    - networkx.algorithms.approximation.traveling_salesman.greedy_tsp
    - <builtin>.sum
    - soln.pop
    - networkx.utils.misc.pairwise
    - cycle.append
    - <builtin>.any
    - itertools.pairwise
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - nodeset.remove
    - itertools.chain
    - cycle.copy
    - G.adj.items
    - <builtin>.list
    - networkx.algorithms.approximation.traveling_salesman.move_one_node
    - G.neighbors
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - <builtin>.min
    - itertools.tee
    - G.nbunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.mst
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7345a93a90>
    - <ast.Constant object at 0x7f7345a93a60>
    - <ast.Constant object at 0x7f7345a93a30>
    - <ast.Constant object at 0x7f7345a93a00>
    - <ast.Constant object at 0x7f7345a939d0>
    argNames:
    - G
    - minimum
    - weight
    - keys
    - data
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 47
    functionName: networkx.algorithms.tree.mst.boruvka_mst_edges
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - networkx.edge_boundary
    - math.isnan
    - <builtin>.sorted
    - <builtin>.float
    - networkx.utils.union_find.UnionFind.to_sets
    - <builtin>.iter
    - networkx.utils.union_find.UnionFind.__init__
    - <builtin>.dict
    - networkx.utils.misc.groups
    - many_to_one.items
    - <builtin>.next
    - networkx.algorithms.tree.mst.boruvka_mst_edges.best_edge
    - networkx.utils.union_find.UnionFind.union
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - component
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.algorithms.tree.mst.boruvka_mst_edges.best_edge
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 1
    functionsReached:
    - networkx.edge_boundary
    - math.isnan
    - <builtin>.float
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.edge_boundary
    functionSourceFile: ''
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.isnan
    functionSourceFile: math
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 13
    IfCount: 13
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa84f0>
    - <ast.Constant object at 0x7f734aaa86a0>
    - <ast.Constant object at 0x7f734aaa8940>
    - <ast.Constant object at 0x7f734aaa8310>
    - <ast.Constant object at 0x7f734aaa8a90>
    argNames:
    - G
    - minimum
    - weight
    - keys
    - data
    - ignore_nan
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 146
    functionName: networkx.algorithms.tree.mst.kruskal_mst_edges
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 8
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - <builtin>.sorted
    - <builtin>.hasattr
    - d.get
    - included_edges.extend
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.iter
    - networkx.utils.union_find.UnionFind.__init__
    - operator.itemgetter
    - <builtin>.next
    - networkx.utils.union_find.UnionFind.union
    - open_edges.append
    - included_edges.append
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: included_edges.append
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: open_edges.append
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: included_edges.extend
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 17
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 10
    EdgeCount: 25
    ICount: 11
    IfCount: 17
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0f340>
    - <ast.Constant object at 0x7f734cd0fe50>
    - <ast.Constant object at 0x7f734cd0f580>
    - <ast.Constant object at 0x7f734cd0f610>
    argNames:
    - G
    - minimum
    - weight
    - keys
    - data
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 257
    functionName: networkx.algorithms.tree.mst.prim_mst_edges
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - math.isnan
    - visited.add
    - nodes.discard
    - d.get
    - heapq.heappop
    - keydict.items
    - itertools.count
    - <builtin>.set
    - G.is_multigraph
    - heapq.heappush
    - <builtin>.next
    - nodes.pop
    - d2.get
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes.discard
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d2.get
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734c35edc0>
    - <ast.Constant object at 0x7f734c35ebe0>
    - <ast.Constant object at 0x7f734c35ef10>
    - <ast.Constant object at 0x7f734c35e5e0>
    - <ast.Constant object at 0x7f734c35e3d0>
    argNames:
    - G
    - algorithm
    - weight
    - keys
    - data
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 371
    functionName: networkx.algorithms.tree.mst.minimum_spanning_edges
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 1
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - <builtin>.sorted
    - <builtin>.hasattr
    - d.get
    - included_edges.extend
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.iter
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - networkx.utils.union_find.UnionFind.__init__
    - operator.itemgetter
    - <builtin>.next
    - networkx.utils.union_find.UnionFind.union
    - open_edges.append
    - included_edges.append
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f190>
    - <ast.Constant object at 0x7f734b06f490>
    - <ast.Constant object at 0x7f734b06f970>
    - <ast.Constant object at 0x7f734b06f790>
    - <ast.Constant object at 0x7f734b06f280>
    argNames:
    - G
    - algorithm
    - weight
    - keys
    - data
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 466
    functionName: networkx.algorithms.tree.mst.maximum_spanning_edges
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 1
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - <builtin>.sorted
    - <builtin>.hasattr
    - d.get
    - included_edges.extend
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.iter
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - networkx.utils.union_find.UnionFind.__init__
    - operator.itemgetter
    - <builtin>.next
    - networkx.utils.union_find.UnionFind.union
    - open_edges.append
    - included_edges.append
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55d60>
    - <ast.Constant object at 0x7f734bb55130>
    - <ast.Constant object at 0x7f734bb557c0>
    argNames:
    - G
    - weight
    - algorithm
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 559
    functionName: networkx.algorithms.tree.mst.minimum_spanning_tree
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - T.add_edges_from
    - <builtin>.sorted
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - T.graph.update
    - networkx.algorithms.tree.mst.minimum_spanning_edges
    - nbrs.items
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - included_edges.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - operator.itemgetter
    - T.add_nodes_from
    - <builtin>.next
    - open_edges.append
    - <builtin>.hasattr
    - included_edges.extend
    - <builtin>.iter
    - networkx.utils.union_find.UnionFind.union
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.utils.union_find.UnionFind.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.graph.update
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.add_nodes_from
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7e370>
    - <ast.Constant object at 0x7f734bb7e460>
    - <ast.Constant object at 0x7f734bb7eac0>
    - <ast.Constant object at 0x7f734bb7ee20>
    argNames:
    - G
    - minimum
    - weight
    - partition
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 619
    functionName: networkx.algorithms.tree.mst.partition_spanning_tree
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 3
    functionsReached:
    - <builtin>.sorted
    - T.add_edges_from
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - T.graph.update
    - nbrs.items
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - included_edges.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - operator.itemgetter
    - T.add_nodes_from
    - <builtin>.next
    - open_edges.append
    - <builtin>.hasattr
    - included_edges.extend
    - <builtin>.iter
    - G.nodes.items
    - networkx.utils.union_find.UnionFind.union
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.utils.union_find.UnionFind.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb310>
    - <ast.Constant object at 0x7f734ccfb280>
    - <ast.Constant object at 0x7f734ccfb9a0>
    argNames:
    - G
    - weight
    - algorithm
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 683
    functionName: networkx.algorithms.tree.mst.maximum_spanning_tree
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - T.add_edges_from
    - <builtin>.sorted
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - T.graph.update
    - nbrs.items
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - networkx.algorithms.tree.mst.maximum_spanning_edges
    - included_edges.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - operator.itemgetter
    - T.add_nodes_from
    - <builtin>.next
    - open_edges.append
    - <builtin>.hasattr
    - included_edges.extend
    - <builtin>.list
    - <builtin>.iter
    - networkx.utils.union_find.UnionFind.union
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.utils.union_find.UnionFind.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - merged_nodes
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 791
    functionName: networkx.algorithms.tree.mst.random_spanning_tree.find_node
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 4
    functionsReached:
    - networkx.algorithms.tree.mst.random_spanning_tree.find_node
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 823
    functionName: networkx.algorithms.tree.mst.random_spanning_tree.prepare_graph
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 3
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - d.popitem
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.contracted_nodes
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.tree.mst.random_spanning_tree.find_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.contracted_nodes
    functionSourceFile: ''
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 866
    functionName: networkx.algorithms.tree.mst.random_spanning_tree.spanning_tree_total_weight
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 3
    functionsReached:
    - networkx.contracted_edge
    - numpy.linalg.det
    - numpy.diag
    - networkx.laplacian_matrix
    - networkx.is_connected
    - G.number_of_edges
    - A.sum
    - <builtin>.len
    - networkx.is_weakly_connected
    - networkx.adjacency_matrix
    - networkx.is_directed
    - <builtin>.float
    - networkx.algorithms.tree.mst.number_of_spanning_trees
    - G.edges
    - networkx.number_of_spanning_trees
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - root
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1153
    functionName: networkx.algorithms.tree.mst.number_of_spanning_trees
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 4
    functionsReached:
    - numpy.linalg.det
    - numpy.diag
    - networkx.laplacian_matrix
    - networkx.is_connected
    - A.sum
    - <builtin>.len
    - networkx.is_weakly_connected
    - networkx.adjacency_matrix
    - <builtin>.float
    - networkx.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.uniform
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: V.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: U.add
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator.Partition
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - dataclasses.field
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1004
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator.Partition.__copy__
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a5bb4f0>
    - <ast.Constant object at 0x7f734a5bb250>
    - <ast.Constant object at 0x7f734a5bb5e0>
    argNames:
    - self
    - G
    - weight
    - minimum
    - ignore_nan
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1009
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator.__init__
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - G.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1039
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator.__iter__
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - T.add_edges_from
    - queue.PriorityQueue.put
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - T.graph.update
    - nbrs.items
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - included_edges.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - networkx.algorithms.tree.mst.partition_spanning_tree
    - operator.itemgetter
    - T.add_nodes_from
    - <builtin>.next
    - queue.PriorityQueue
    - open_edges.append
    - <builtin>.hasattr
    - included_edges.extend
    - <builtin>.iter
    - G.is_multigraph
    - G.nodes.items
    - G.edges
    - networkx.utils.union_find.UnionFind.union
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.algorithms.tree.mst.SpanningTreeIterator._clear_partition
    - networkx.utils.union_find.UnionFind.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1139
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator._clear_partition
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 2
    functionsReached:
    - G.is_multigraph
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1058
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator.__next__
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 0
    functionsReached:
    - p1_mst.size
    - T.add_edges_from
    - <builtin>.sorted
    - queue.PriorityQueue.put
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - T.graph.update
    - nbrs.items
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - networkx.algorithms.tree.mst.SpanningTreeIterator._partition
    - networkx.algorithms.tree.mst.SpanningTreeIterator._write_partition
    - included_edges.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - networkx.algorithms.tree.mst.partition_spanning_tree
    - networkx.is_connected
    - partition.partition_dict.copy
    - operator.itemgetter
    - partition_dict.get
    - T.add_nodes_from
    - <builtin>.next
    - open_edges.append
    - <builtin>.hasattr
    - included_edges.extend
    - <builtin>.tuple
    - <builtin>.iter
    - G.is_multigraph
    - p2.partition_dict.copy
    - G.nodes.items
    - G.edges
    - networkx.utils.union_find.UnionFind.union
    - queue.PriorityQueue.get
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.algorithms.tree.mst.SpanningTreeIterator._clear_partition
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.tree.mst.SpanningTreeIterator.Partition.__copy__
    - queue.PriorityQueue.empty
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1117
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator._write_partition
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 2
    functionsReached:
    - partition_dict.get
    - G.is_multigraph
    - G.edges
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - partition
    - partition_tree
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1080
    functionName: networkx.algorithms.tree.mst.SpanningTreeIterator._partition
    functionSourceFile: networkx.algorithms.tree.mst
    functionUses: 1
    functionsReached:
    - p1_mst.size
    - T.add_edges_from
    - <builtin>.sorted
    - queue.PriorityQueue.put
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - T.graph.update
    - nbrs.items
    - networkx.algorithms.tree.mst.kruskal_mst_edges
    - networkx.algorithms.tree.mst.SpanningTreeIterator._write_partition
    - included_edges.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.isnan
    - networkx.algorithms.tree.mst.partition_spanning_tree
    - networkx.is_connected
    - partition.partition_dict.copy
    - operator.itemgetter
    - partition_dict.get
    - T.add_nodes_from
    - <builtin>.next
    - open_edges.append
    - <builtin>.hasattr
    - included_edges.extend
    - <builtin>.tuple
    - <builtin>.iter
    - G.is_multigraph
    - p2.partition_dict.copy
    - G.nodes.items
    - G.edges
    - networkx.utils.union_find.UnionFind.union
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.tree.mst.SpanningTreeIterator.Partition.__copy__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: partition_dict.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.det
    functionSourceFile: numpy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.diag
    functionSourceFile: numpy
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.kcomponents
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 6
    IfCount: 6
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7346b3c160>
    argNames:
    - G
    - min_density
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 18
    functionName: networkx.algorithms.approximation.kcomponents.k_components
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - networkx.algorithms.approximation.connectivity._bidirectional_shortest_path
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - path.reverse
    - networkx.convert.to_networkx_graph
    - nbrs.items
    - <builtin>.str
    - networkx.algorithms.approximation.kcomponents._same
    - H.subgraph
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - networkx.algorithms.core.k_shell.k_filter
    - networkx.from_pandas_adjacency
    - networkx.number_of_selfloops
    - networkx.from_scipy_sparse_array
    - <builtin>.float
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.combinations
    - reverse_fringe.append
    - itertools.chain.from_iterable
    - networkx.connected_components
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - sh_deg.items
    - networkx.all_neighbors
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - forward_fringe.append
    - networkx.algorithms.approximation.connectivity.local_node_connectivity
    - networkx.algorithms.approximation.kcomponents._cliques_heuristic
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - stack.pop
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - core.values
    - h_cnumber.items
    - G.is_directed
    - <builtin>.hasattr
    - SH.degree
    - G.out_degree
    - sh_deg.values
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.core.k_core
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.algorithms.core.core_number
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - <builtin>.sorted
    - networkx.core_number
    - <builtin>.sum
    - newdict.update
    - bin_boundaries.extend
    - SH.remove_nodes_from
    - G.subgraph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.components.biconnected.biconnected_components
    - <builtin>.len
    - networkx.algorithms.core.k_corona.func
    - A.is_strict
    - set.intersection
    - networkx.algorithms.approximation.connectivity._bidirectional_pred_succ
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - networkx.biconnected_components
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - SG.nodes
    - exclude.update
    - <builtin>.range
    - networkx.algorithms.core.k_core.k_filter
    - networkx.k_core
    - path.append
    - SG.subgraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - datadict.items
    - networkx.empty_graph
    - edge_stack.append
    - h_cnumber.values
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.core._core_subgraph
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - measure.values
    - networkx.classes.reportviews.OutEdgeView.__init__
    - g_cnumber.values
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.next
    - G.in_degree
    - networkx.classes.graph.Graph.__init__
    - networkx.density
    - <builtin>.list
    - d.items
    - N.graph.update
    - visited.add
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.biconnected_components
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g_cnumber.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d38c0d0>
    - <ast.Constant object at 0x7f734d38c8b0>
    argNames:
    - G
    - k
    - core_number
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 154
    functionName: networkx.algorithms.core.k_core
    functionSourceFile: networkx.algorithms.core
    functionUses: 1
    functionsReached:
    - networkx.algorithms.core.k_core.k_filter
    - <builtin>.sorted
    - G.subgraph
    - <builtin>.max
    - <builtin>.list
    - <builtin>.sum
    - networkx.algorithms.core._core_subgraph
    - networkx.algorithms.core.core_number
    - <builtin>.dict
    - networkx.algorithms.core.k_shell.k_filter
    - bin_boundaries.extend
    - networkx.all_neighbors
    - networkx.number_of_selfloops
    - <builtin>.enumerate
    - G.degree
    - networkx.algorithms.core.k_corona.func
    - core.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: SG.nodes
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - H
    - k
    - min_density
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 159
    functionName: networkx.algorithms.approximation.kcomponents._cliques_heuristic
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - h_cnumber.values
    - sh_deg.items
    - <builtin>.enumerate
    - networkx.algorithms.approximation.kcomponents._same
    - H.subgraph
    - SH.remove_nodes_from
    - measure.values
    - G.subgraph
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - set.intersection
    - h_cnumber.items
    - SH.degree
    - networkx.density
    - sh_deg.values
    - networkx.k_core
    - <builtin>.min
    - <builtin>.dict
    - networkx.core_number
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: SG.subgraph
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.k_core
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.core_number
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h_cnumber.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h_cnumber.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e100>
    argNames:
    - measure
    - tol
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 190
    functionName: networkx.algorithms.approximation.kcomponents._same
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 2
    functionsReached:
    - <builtin>.max
    - <builtin>.set
    - measure.values
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.density
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: SH.degree
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sh_deg.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sh_deg.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: SH.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: measure.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 218
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.__getitem__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - graph
    - node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 249
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__init__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 254
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__len__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 257
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__iter__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - nbr
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 260
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__getitem__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - graph
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 269
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__init__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 273
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__len__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 276
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__iter__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 279
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__getitem__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__init__
    linkageType: pythonLinkage
    raised:
    - KeyError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - functools.cached_property
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 285
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.adj
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 304
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiDegreeView.__iter__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - n
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 310
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.AntiDegreeView.__getitem__
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 354
    functionName: networkx.algorithms.approximation.kcomponents._AntiGraph.adjacency
    functionSourceFile: networkx.algorithms.approximation.kcomponents
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - <builtin>.set
    - networkx.classes.coreviews.UnionAdjacency.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.matching
    functionSourceFile: networkx.algorithms.approximation.matching
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.maximal_matching
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.distance_measures
    functionSourceFile: networkx.algorithms.approximation.distance_measures
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41520>
    argNames:
    - G
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 11
    functionName: networkx.algorithms.approximation.distance_measures.diameter
    functionSourceFile: networkx.algorithms.approximation.distance_measures
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.shortest_path_length
    - G.reverse
    - networkx.algorithms.approximation.distance_measures._two_sweep_undirected
    - <builtin>.max
    - networkx.eccentricity
    - seed.choice
    - G.number_of_nodes
    - <builtin>.list
    - <builtin>.len
    - networkx.algorithms.approximation.distance_measures._two_sweep_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 113
    functionName: networkx.algorithms.approximation.distance_measures._two_sweep_directed
    functionSourceFile: networkx.algorithms.approximation.distance_measures
    functionUses: 1
    functionsReached:
    - networkx.shortest_path_length
    - G.reverse
    - <builtin>.max
    - networkx.eccentricity
    - seed.choice
    - <builtin>.list
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 87
    functionName: networkx.algorithms.approximation.distance_measures._two_sweep_undirected
    functionSourceFile: networkx.algorithms.approximation.distance_measures
    functionUses: 1
    functionsReached:
    - networkx.shortest_path_length
    - networkx.eccentricity
    - seed.choice
    - <builtin>.list
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.eccentricity
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.steinertree
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7345867a60>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 11
    functionName: networkx.algorithms.approximation.steinertree.metric_closure
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - <builtin>.set
    - networkx.all_pairs_dijkstra
    - Gnodes.remove
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - warnings.warn
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Gnodes.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - terminal_nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 65
    functionName: networkx.algorithms.approximation.steinertree._mehlhorn_steiner_tree
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 1
    functionsReached:
    - G.remove_nodes_from
    - <builtin>.zip
    - keydict.get
    - networkx.multi_source_dijkstra
    - set.union
    - G_4.edges
    - networkx.shortest_path
    - networkx.utils.misc.pairwise
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.pairwise
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - data.get
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - itertools.chain
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - G.is_multigraph
    - G.edges
    - networkx.algorithms.approximation.steinertree._remove_nonterminal_leaves
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.nodes
    - G.edge_subgraph
    - <builtin>.min
    - itertools.tee
    - networkx.minimum_spanning_edges
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.multi_source_dijkstra
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.minimum_spanning_edges
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.steinertree._mehlhorn_steiner_tree.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - terminals
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 149
    functionName: networkx.algorithms.approximation.steinertree._remove_nonterminal_leaves
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 3
    functionsReached:
    - G.remove_nodes_from
    - <builtin>.len
    - <builtin>.set
    - set.union
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_4.edges
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - terminal_nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 105
    functionName: networkx.algorithms.approximation.steinertree._kou_steiner_tree
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - G.remove_nodes_from
    - <builtin>.zip
    - keydict.get
    - set.union
    - networkx.utils.misc.pairwise
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx._clear_cache
    - itertools.pairwise
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - itertools.chain
    - T_H.edges
    - G.is_multigraph
    - networkx.algorithms.approximation.steinertree._remove_nonterminal_leaves
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.single_source_dijkstra
    - unvisited_terminals.pop
    - G.edge_subgraph
    - <builtin>.min
    - itertools.tee
    - unvisited_terminals.remove
    - networkx.minimum_spanning_edges
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - unvisited_terminals.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unvisited_terminals.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_dijkstra
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unvisited_terminals.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unvisited_terminals.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.steinertree._kou_steiner_tree.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T_H.edges
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d425b50>
    - <ast.Constant object at 0x7f734d425a30>
    argNames:
    - G
    - terminal_nodes
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 175
    functionName: networkx.algorithms.approximation.steinertree.steiner_tree
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached:
    - G.remove_nodes_from
    - <builtin>.zip
    - keydict.get
    - networkx.multi_source_dijkstra
    - set.union
    - G_4.edges
    - networkx.shortest_path
    - networkx.utils.misc.pairwise
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.pairwise
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - data.get
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - itertools.chain
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - G.is_multigraph
    - G.edges
    - networkx.algorithms.approximation.steinertree._remove_nonterminal_leaves
    - networkx.algorithms.approximation.steinertree._mehlhorn_steiner_tree
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.edge_subgraph
    - G.nodes
    - <builtin>.min
    - itertools.tee
    - networkx.minimum_spanning_edges
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.approximation.steinertree.steiner_tree.<lambda1>
    functionSourceFile: networkx.algorithms.approximation.steinertree
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal
    functionSourceFile: networkx.algorithms.traversal
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.depth_first_search
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_edges.<lambda1>
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb430>
    - <ast.Constant object at 0x7f734ccfb820>
    argNames:
    - G
    - source
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 116
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_tree
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 0
    functionsReached:
    - stack.append
    - attr_dict.update
    - visited.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - <builtin>.iter
    - newdict.update
    - <builtin>.len
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dfs_labeled_edges
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.<lambda1>
    functionSourceFile: networkx.algorithms.traversal.depth_first_search
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.edgebfs
    functionSourceFile: networkx.algorithms.traversal.edgebfs
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - node
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 144
    functionName: networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    functionSourceFile: networkx.algorithms.traversal.edgebfs
    functionUses: 191
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.iter
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edge
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 163
    functionName: networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    functionSourceFile: networkx.algorithms.traversal.edgebfs
    functionUses: 191
    functionsReached:
    - <builtin>.frozenset
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: visited_nodes.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: visited_edges.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.beamsearch
    functionSourceFile: networkx.algorithms.traversal.beamsearch
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 68
    functionName: networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    functionSourceFile: networkx.algorithms.traversal.beamsearch
    functionUses: 198
    functionsReached:
    - <builtin>.iter
    - <builtin>.sorted
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.generic_bfs_edges
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.breadth_first_search
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.neighbors
    functionSourceFile: copy
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.predecessors
    functionSourceFile: copy
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 198
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.classes.digraph.DiGraph.predecessors
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - <builtin>.set
    - copy.deepcopy.neighbors
    - copy.deepcopy.predecessors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: next_parents_children.append
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.is_directed
    functionSourceFile: copy
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55520>
    - <ast.Constant object at 0x7f734bb55d60>
    - <ast.Constant object at 0x7f734cbf2490>
    argNames:
    - G
    - source
    - reverse
    - depth_limit
    - sort_neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 198
    functionName: networkx.algorithms.traversal.breadth_first_search.bfs_tree
    functionSourceFile: networkx.algorithms.traversal.breadth_first_search
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - <builtin>.sorted
    - networkx.classes.digraph.DiGraph.add_node
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - attr_dict.update
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.neighbors
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - networkx._clear_cache
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: children.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: next_layer.append
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: depth.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.traversal.edgedfs
    functionSourceFile: networkx.algorithms.traversal.edgedfs
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - node
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 130
    functionName: networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    functionSourceFile: networkx.algorithms.traversal.edgedfs
    functionUses: 191
    functionsReached:
    - <builtin>.iter
    - G.in_edges
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.in_edges
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edge
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 148
    functionName: networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    functionSourceFile: networkx.algorithms.traversal.edgedfs
    functionUses: 191
    functionsReached:
    - <builtin>.frozenset
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.perfect_graph
    functionSourceFile: networkx.algorithms.perfect_graph
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 12
    functionName: networkx.algorithms.perfect_graph.is_perfect_graph
    functionSourceFile: networkx.algorithms.perfect_graph
    functionUses: 0
    functionsReached:
    - networkx.complement
    - <builtin>.len
    - networkx.chordless_cycles
    - itertools.chain
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.chordless_cycles
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.cuts
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24eb0>
    - <ast.Constant object at 0x7f734cd24490>
    argNames:
    - G
    - S
    - T
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 23
    functionName: networkx.algorithms.cuts.cut_size
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 4
    functionsReached:
    - G.is_directed
    - networkx.edge_boundary
    - itertools.chain
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64b340>
    argNames:
    - G
    - S
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 86
    functionName: networkx.algorithms.cuts.volume
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 2
    functionsReached:
    - G.is_directed
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb940>
    - <ast.Constant object at 0x7f734ccfb3a0>
    argNames:
    - G
    - S
    - T
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 129
    functionName: networkx.algorithms.cuts.normalized_cut_size
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.algorithms.cuts.volume
    - networkx.algorithms.cuts.cut_size
    - networkx.edge_boundary
    - <builtin>.sum
    - <builtin>.set
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55940>
    - <ast.Constant object at 0x7f734bb55760>
    argNames:
    - G
    - S
    - T
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 182
    functionName: networkx.algorithms.cuts.conductance
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.algorithms.cuts.volume
    - networkx.algorithms.cuts.cut_size
    - networkx.edge_boundary
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.set
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7ed90>
    - <ast.Constant object at 0x7f734bb7e9a0>
    argNames:
    - G
    - S
    - T
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 230
    functionName: networkx.algorithms.cuts.edge_expansion
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.algorithms.cuts.cut_size
    - networkx.edge_boundary
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.set
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfe340>
    - <ast.Constant object at 0x7f734cbfea90>
    argNames:
    - G
    - S
    - T
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 277
    functionName: networkx.algorithms.cuts.mixing_expansion
    functionSourceFile: networkx.algorithms.cuts
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.edge_boundary
    - networkx.algorithms.cuts.cut_size
    - G.number_of_edges
    - <builtin>.sum
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.node_boundary
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.cycles
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gnodes.popitem
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cycles.append
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gnodes.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Gu.items
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: visited.intersection
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 5
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - length_bound
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 240
    functionName: networkx.algorithms.cycles._directed_cycle_search
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 191
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - scc_queue.pop
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.cycles._johnson_cycle_search
    - lock.get
    - attr_dict.update
    - scc.add
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - queue.pop
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - queue.append
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - components.extend
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - blen.append
    - networkx.from_pandas_edgelist
    - blocked.add
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - G.__class__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - scc_found.update
    - components.pop
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.cycles._bounded_cycle_search
    - path.append
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - scc_queue.append
    - <builtin>.list
    - d.items
    - N.graph.update
    - networkx.freeze
    - closed.append
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 5
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - length_bound
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 290
    functionName: networkx.algorithms.cycles._undirected_cycle_search
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 191
    functionsReached:
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - networkx.algorithms.cycles._johnson_cycle_search
    - lock.get
    - attr_dict.update
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - collections.defaultdict
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.chain.from_iterable
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - components.extend
    - networkx.classes.digraph.DiGraph.remove_edge
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - stack.pop
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - <builtin>.hasattr
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.subgraph
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - blocked.add
    - networkx.from_pandas_edgelist
    - blen.append
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.__class__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.components.biconnected.biconnected_components
    - <builtin>.len
    - A.is_strict
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - components.pop
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.cycles._bounded_cycle_search
    - path.append
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - edge_stack.append
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.filters.show_nodes.__init__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - d.popitem
    - <builtin>.list
    - d.items
    - N.graph.update
    - visited.add
    - networkx.freeze
    - closed.append
    - result.graph.update
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.coreviews.FilterAdjacency.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: components.pop
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - path
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 356
    functionName: networkx.algorithms.cycles._johnson_cycle_search
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 193
    functionsReached:
    - collections.defaultdict
    - stack.append
    - path.append
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - closed.append
    - <builtin>.iter
    - <builtin>.set
    - blocked.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - path
    - length_bound
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 416
    functionName: networkx.algorithms.cycles._bounded_cycle_search
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 193
    functionsReached:
    - collections.defaultdict
    - stack.append
    - path.append
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - <builtin>.iter
    - <builtin>.len
    - blen.append
    - lock.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: components.extend
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 348
    functionName: networkx.algorithms.cycles._NeighborhoodCache.__init__
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 351
    functionName: networkx.algorithms.cycles._NeighborhoodCache.__missing__
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 0
    functionsReached:
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: closed.append
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: blocked.add
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lock.get
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: blen.append
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Gv.get
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734825a3d0>
    - <ast.Constant object at 0x7f734825a400>
    argNames:
    - self
    - reciprocal
    - as_view
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 1405
    functionName: networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 191
    functionsReached:
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - d.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - networkx.empty_graph
    - <builtin>.iter
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - C
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 671
    functionName: networkx.algorithms.cycles.chordless_cycles.stems
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 191
    functionsReached:
    - networkx.classes.multigraph.MultiGraph.has_edge
    - G.has_edge
    - itertools.combinations
    - networkx.classes.graph.Graph.has_edge
    - itertools.product
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - F
    - B
    - path
    - length_bound
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 692
    functionName: networkx.algorithms.cycles._chordless_cycle_search
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 191
    functionsReached:
    - collections.defaultdict
    - stack.append
    - path.append
    - <builtin>.iter
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 771
    functionName: networkx.algorithms.cycles.recursive_simple_cycles
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - <builtin>.range
    - networkx.algorithms.cycles.recursive_simple_cycles._unblock
    - G.subgraph
    - networkx.algorithms.cycles.recursive_simple_cycles.circuit
    - <builtin>.zip
    - path.append
    - G.remove_edge
    - <builtin>.min
    - G.has_edge
    - <builtin>.len
    - <builtin>.dict
    - result.append
    - networkx.strongly_connected_components
    - path.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - thisnode
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 819
    functionName: networkx.algorithms.cycles.recursive_simple_cycles._unblock
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 2
    functionsReached:
    - networkx.algorithms.cycles.recursive_simple_cycles._unblock
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 3
    argDefaultValues: []
    argNames:
    - thisnode
    - startnode
    - component
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 826
    functionName: networkx.algorithms.cycles.recursive_simple_cycles.circuit
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 1
    functionsReached:
    - networkx.algorithms.cycles.recursive_simple_cycles._unblock
    - networkx.algorithms.cycles.recursive_simple_cycles.circuit
    - path.append
    - result.append
    - path.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.pop
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.cycles.recursive_simple_cycles.<lambda1>
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 0
    functionsReached:
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - edge
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 960
    functionName: networkx.algorithms.cycles.find_cycle.tailhead
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.edge_dfs
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: active_nodes.remove
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cycle.extend
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: active_nodes.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: explored.update
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73444445e0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 1043
    functionName: networkx.algorithms.cycles.minimum_cycle_basis
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 0
    functionsReached:
    - networkx.reverse_view
    - <builtin>.zip
    - path.reverse
    - H.add_edges_from
    - itertools.islice
    - networkx.single_source_shortest_path_length
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - in_q.remove
    - networkx.algorithms.shortest_paths.generic.shortest_path_length
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length
    - H.graph.update
    - networkx.bellman_ford_path_length
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - <builtin>.float
    - networkx.dijkstra_path_length
    - seen.discard
    - d.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - networkx.bidirectional_shortest_path
    - networkx.connected_components
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - keydict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    - keylist.append
    - <builtin>.all
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - cb.append
    - collections.deque.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.hasattr
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.callable
    - networkx.algorithms.cycles._min_cycle_basis
    - H.add_nodes_from
    - set_orth.pop
    - min_edgelist.append
    - <builtin>.min
    - count.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - edgeset.remove
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.deque.popleft
    - edgeset.add
    - networkx._clear_cache
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.all_pairs_bellman_ford_path_length
    - <builtin>.sum
    - nextlevel.append
    - itertools.pairwise
    - G.subgraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.cycles._min_cycle
    - <builtin>.len
    - attr.get
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.reverse
    - heapq.heappush
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - path.append
    - networkx.minimum_spanning_edges
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.all_pairs_shortest_path_length
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length
    - <builtin>.reversed
    - data.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - <builtin>.next
    - pred_dict.get
    - itertools.chain
    - <builtin>.list
    - itertools.count
    - collections.deque
    - networkx.all_pairs_dijkstra_path_length
    - in_q.add
    - itertools.tee
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 1087
    functionName: networkx.algorithms.cycles._min_cycle_basis
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 1
    functionsReached:
    - networkx.reverse_view
    - <builtin>.zip
    - path.reverse
    - H.add_edges_from
    - itertools.islice
    - networkx.single_source_shortest_path_length
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - in_q.remove
    - networkx.algorithms.shortest_paths.generic.shortest_path_length
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length
    - H.graph.update
    - networkx.bellman_ford_path_length
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - <builtin>.float
    - networkx.dijkstra_path_length
    - seen.discard
    - d.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - networkx.bidirectional_shortest_path
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - keydict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    - keylist.append
    - <builtin>.all
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - cb.append
    - collections.deque.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.hasattr
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.callable
    - H.add_nodes_from
    - set_orth.pop
    - min_edgelist.append
    - <builtin>.min
    - count.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - edgeset.remove
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.deque.popleft
    - edgeset.add
    - networkx._clear_cache
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.all_pairs_bellman_ford_path_length
    - <builtin>.sum
    - nextlevel.append
    - itertools.pairwise
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.cycles._min_cycle
    - <builtin>.len
    - attr.get
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.reverse
    - heapq.heappush
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - path.append
    - networkx.minimum_spanning_edges
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.all_pairs_shortest_path_length
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length
    - <builtin>.reversed
    - data.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - <builtin>.next
    - pred_dict.get
    - itertools.chain
    - <builtin>.list
    - itertools.count
    - collections.deque
    - networkx.all_pairs_dijkstra_path_length
    - in_q.add
    - itertools.tee
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: set_orth.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 10
    IfCount: 5
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - orth
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1117
    functionName: networkx.algorithms.cycles._min_cycle
    functionSourceFile: networkx.algorithms.cycles
    functionUses: 2
    functionsReached:
    - networkx.reverse_view
    - <builtin>.zip
    - path.reverse
    - H.add_edges_from
    - itertools.islice
    - networkx.single_source_shortest_path_length
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - in_q.remove
    - networkx.algorithms.shortest_paths.generic.shortest_path_length
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length
    - H.graph.update
    - networkx.bellman_ford_path_length
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - <builtin>.float
    - networkx.dijkstra_path_length
    - seen.discard
    - d.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - networkx.bidirectional_shortest_path
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - keydict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    - keylist.append
    - <builtin>.all
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.hasattr
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.callable
    - H.add_nodes_from
    - min_edgelist.append
    - <builtin>.min
    - count.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - edgeset.remove
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.multigraph.MultiGraph.is_directed
    - edgeset.add
    - networkx._clear_cache
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.all_pairs_bellman_ford_path_length
    - nextlevel.append
    - itertools.pairwise
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - attr.get
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.reverse
    - heapq.heappush
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.edges
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - path.append
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.all_pairs_shortest_path_length
    - networkx.shortest_path
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length
    - <builtin>.reversed
    - data.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - <builtin>.next
    - pred_dict.get
    - itertools.chain
    - <builtin>.list
    - itertools.count
    - collections.deque
    - networkx.all_pairs_dijkstra_path_length
    - in_q.add
    - itertools.tee
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cb.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 1
    IfCount: 13
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e610>
    - <ast.Constant object at 0x7f734b66e430>
    - <ast.Constant object at 0x7f734b66ec70>
    - <ast.Constant object at 0x7f734b66e6a0>
    argNames:
    - G
    - source
    - target
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 182
    functionName: networkx.algorithms.shortest_paths.generic.shortest_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 3
    functionsReached:
    - networkx.bidirectional_shortest_path
    - dist.get
    - networkx.reverse_view
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.all_pairs_bellman_ford_path_length
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    - H.add_edges_from
    - itertools.islice
    - <builtin>.all
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.all_pairs_shortest_path_length
    - seen.add
    - networkx.single_source_shortest_path_length
    - nextlevel.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - networkx.classes.graph.Graph.is_directed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length
    - <builtin>.next
    - pred_dict.get
    - H.graph.update
    - stack.append
    - <builtin>.hasattr
    - networkx.bellman_ford_path_length
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.reverse
    - itertools.count
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - <builtin>.callable
    - heapq.heappush
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.add_nodes_from
    - networkx.dijkstra_path_length
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - networkx.all_pairs_dijkstra_path_length
    - d.values
    - in_q.add
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - count.get
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - collections.deque.popleft
    - <builtin>.min
    - copy.deepcopy
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgeset.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgeset.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: min_edgelist.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bfs_labeled_edges
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.smallworld
    functionSourceFile: networkx.algorithms.smallworld
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 9
    IfCount: 6
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7347e7a0a0>
    - <ast.Constant object at 0x7f7347e7a070>
    - <ast.Constant object at 0x7f7347e7a040>
    argNames:
    - G
    - niter
    - connectivity
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 28
    functionName: networkx.algorithms.smallworld.random_reference
    functionSourceFile: networkx.algorithms.smallworld
    functionUses: 192
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.maximum_flow_value
    - networkx.number_of_edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.hasattr
    - G.add_edge
    - G.remove_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - bisect.bisect_left
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - G.neighbors
    - <builtin>.range
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - seed.choice
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - G.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_of_edges
    functionSourceFile: ''
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734cae7760>
    - <ast.Constant object at 0x7f734cae7640>
    - <ast.Constant object at 0x7f734cae7df0>
    - <ast.Constant object at 0x7f734cae7700>
    argNames:
    - G
    - s
    - t
    - flow_func
    - auxiliary
    - residual
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 488
    functionName: networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 198
    functionsReached:
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.maximum_flow_value
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 9
    IfCount: 8
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfe0d0>
    - <ast.Constant object at 0x7f734cbfef70>
    - <ast.Constant object at 0x7f734cbfe700>
    - <ast.Constant object at 0x7f734cbfea90>
    argNames:
    - G
    - niter
    - D
    - connectivity
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 126
    functionName: networkx.algorithms.smallworld.lattice_reference
    functionSourceFile: networkx.algorithms.smallworld
    functionUses: 191
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - numpy.append
    - networkx.maximum_flow_value
    - networkx.number_of_edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - keys.index
    - numpy.ceil
    - numpy.where
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.hasattr
    - G.add_edge
    - G.remove_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - bisect.bisect_left
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - numpy.arange
    - G.neighbors
    - <builtin>.range
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - seed.choice
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - G.copy
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.where
    functionSourceFile: numpy
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.append
    functionSourceFile: numpy
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.ceil
    functionSourceFile: numpy
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: keys.index
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.transitivity
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.average_shortest_path_length
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.average_clustering
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.hierarchy
    functionSourceFile: networkx.algorithms.hierarchy
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9d5e0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.algorithms.hierarchy.flow_hierarchy
    functionSourceFile: networkx.algorithms.hierarchy
    functionUses: 0
    functionsReached:
    - G.is_directed
    - G.size
    - G.subgraph
    - networkx.is_empty
    - <builtin>.sum
    - networkx.strongly_connected_components
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_empty
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.size
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.lowest_common_ancestors
    functionSourceFile: networkx.algorithms.lowest_common_ancestors
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - pairs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 97
    functionName: networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    functionSourceFile: networkx.algorithms.lowest_common_ancestors
    functionUses: 192
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - networkx.ancestors
    - G.successors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.vitality
    functionSourceFile: networkx.algorithms.vitality
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf3e20>
    - <ast.Constant object at 0x7f734caf39a0>
    - <ast.Constant object at 0x7f734caf39d0>
    argNames:
    - G
    - node
    - weight
    - wiener_index
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.vitality.closeness_vitality
    functionSourceFile: networkx.algorithms.vitality
    functionUses: 0
    functionsReached:
    - networkx.wiener_index
    - <builtin>.set
    - G.subgraph
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.wiener_index
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.vf2pp
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - collections.namedtuple
    - networkx.is_k_edge_connected
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7344aab460>
    - <ast.Constant object at 0x7f7344aab430>
    argNames:
    - G1
    - G2
    - node_label
    - default_label
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 108
    functionName: networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 1
    functionsReached:
    - T1_tilde.intersection
    - <builtin>.zip
    - common_nodes.difference_update
    - G1.nodes
    - <builtin>.any
    - G1.number_of_nodes
    - T2_in.intersection
    - <builtin>.max
    - networkx.algorithms.isomorphism.vf2pp._matching_order
    - G1.order
    - node_order.append
    - T2_in.discard
    - G1.is_directed
    - G1.to_undirected
    - T1_in.discard
    - dlevel_nodes.copy
    - v_labels_successors.keys
    - networkx.algorithms.isomorphism.vf2pp._precheck_label_properties
    - networkx.algorithms.isomorphism.vf2pp._restore_Tinout
    - G1.is_multigraph
    - T1.add
    - u_labels_predecessors.items
    - candidates.intersection_update
    - networkx.algorithms.isomorphism.vf2pp._feasibility
    - T1_tilde.discard
    - mapping.copy
    - stack.pop
    - <builtin>.set
    - T2.discard
    - T1_in.update
    - networkx.algorithms.isomorphism.vf2pp._cut_PT
    - <builtin>.iter
    - T2_in.update
    - networkx.algorithms.isomorphism.vf2pp._initialize_parameters
    - networkx.algorithms.isomorphism.vf2pp._find_candidates
    - mapping.pop
    - <builtin>.min
    - <builtin>.dict
    - reverse_mapping.pop
    - u_labels_predecessors.keys
    - <builtin>.sorted
    - networkx.algorithms.isomorphism.vf2pp._find_candidates_Di
    - G1_degree.values
    - T1_in.add
    - common_nodes.intersection_update
    - u_labels_successors.items
    - T1.intersection
    - candidates.difference_update
    - G2.nodes
    - T1.update
    - T1.discard
    - networkx.utils.groups
    - <builtin>.len
    - T1_tilde.difference_update
    - networkx.algorithms.isomorphism.vf2pp._update_Tinout
    - networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms
    - stack.append
    - G2.number_of_nodes
    - networkx.algorithms.isomorphism.vf2pp._consistent_PT
    - T2.intersection
    - v_labels_predecessors.keys
    - G1.neighbors
    - G1.number_of_edges
    - G2_degree.values
    - T2.update
    - T1_tilde.add
    - T2_tilde.intersection
    - T1_in.intersection
    - T2.add
    - nodes_of_G2Labels.items
    - nodes_to_add.remove
    - networkx.algorithms.isomorphism.vf2pp._restore_Tinout_Di
    - T2_tilde.add
    - <builtin>.next
    - u_labels_successors.keys
    - T2_in.add
    - covered_predecessors.pop
    - T2_tilde.discard
    - G2.order
    - V1_unordered.discard
    - T2_tilde.difference_update
    - G2.number_of_edges
    - networkx.bfs_layers
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 9
    IfCount: 9
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63d520>
    - <ast.Constant object at 0x7f734d63d2e0>
    argNames:
    - G1
    - G2
    - node_label
    - default_label
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 168
    functionName: networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 2
    functionsReached:
    - T1_tilde.intersection
    - <builtin>.zip
    - common_nodes.difference_update
    - G1.nodes
    - <builtin>.any
    - G1.number_of_nodes
    - T2_in.intersection
    - <builtin>.max
    - networkx.algorithms.isomorphism.vf2pp._matching_order
    - G1.order
    - node_order.append
    - T2_in.discard
    - G1.is_directed
    - G1.to_undirected
    - T1_in.discard
    - dlevel_nodes.copy
    - v_labels_successors.keys
    - networkx.algorithms.isomorphism.vf2pp._precheck_label_properties
    - networkx.algorithms.isomorphism.vf2pp._restore_Tinout
    - G1.is_multigraph
    - T1.add
    - u_labels_predecessors.items
    - candidates.intersection_update
    - networkx.algorithms.isomorphism.vf2pp._feasibility
    - T1_tilde.discard
    - mapping.copy
    - stack.pop
    - <builtin>.set
    - T2.discard
    - T1_in.update
    - networkx.algorithms.isomorphism.vf2pp._cut_PT
    - <builtin>.iter
    - T2_in.update
    - networkx.algorithms.isomorphism.vf2pp._initialize_parameters
    - networkx.algorithms.isomorphism.vf2pp._find_candidates
    - mapping.pop
    - <builtin>.min
    - <builtin>.dict
    - reverse_mapping.pop
    - u_labels_predecessors.keys
    - <builtin>.sorted
    - networkx.algorithms.isomorphism.vf2pp._find_candidates_Di
    - G1_degree.values
    - T1_in.add
    - common_nodes.intersection_update
    - u_labels_successors.items
    - T1.intersection
    - candidates.difference_update
    - G2.nodes
    - T1.update
    - T1.discard
    - networkx.utils.groups
    - <builtin>.len
    - T1_tilde.difference_update
    - networkx.algorithms.isomorphism.vf2pp._update_Tinout
    - stack.append
    - G2.number_of_nodes
    - networkx.algorithms.isomorphism.vf2pp._consistent_PT
    - T2.intersection
    - v_labels_predecessors.keys
    - G1.neighbors
    - G1.number_of_edges
    - G2_degree.values
    - T2.update
    - T1_tilde.add
    - T2_tilde.intersection
    - T1_in.intersection
    - T2.add
    - nodes_of_G2Labels.items
    - nodes_to_add.remove
    - networkx.algorithms.isomorphism.vf2pp._restore_Tinout_Di
    - T2_tilde.add
    - <builtin>.next
    - u_labels_successors.keys
    - T2_in.add
    - covered_predecessors.pop
    - T2_tilde.discard
    - G2.order
    - V1_unordered.discard
    - T2_tilde.difference_update
    - G2.number_of_edges
    - networkx.bfs_layers
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9c880>
    - <ast.Constant object at 0x7f734cf9cb50>
    argNames:
    - G1
    - G2
    - node_label
    - default_label
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 139
    functionName: networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 0
    functionsReached:
    - T1_tilde.intersection
    - <builtin>.zip
    - common_nodes.difference_update
    - G1.nodes
    - <builtin>.any
    - G1.number_of_nodes
    - T2_in.intersection
    - networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism
    - <builtin>.max
    - networkx.algorithms.isomorphism.vf2pp._matching_order
    - G1.order
    - node_order.append
    - T2_in.discard
    - G1.is_directed
    - G1.to_undirected
    - T1_in.discard
    - dlevel_nodes.copy
    - v_labels_successors.keys
    - networkx.algorithms.isomorphism.vf2pp._precheck_label_properties
    - networkx.algorithms.isomorphism.vf2pp._restore_Tinout
    - G1.is_multigraph
    - T1.add
    - u_labels_predecessors.items
    - candidates.intersection_update
    - networkx.algorithms.isomorphism.vf2pp._feasibility
    - T1_tilde.discard
    - mapping.copy
    - stack.pop
    - <builtin>.set
    - T2.discard
    - T1_in.update
    - networkx.algorithms.isomorphism.vf2pp._cut_PT
    - <builtin>.iter
    - T2_in.update
    - networkx.algorithms.isomorphism.vf2pp._initialize_parameters
    - networkx.algorithms.isomorphism.vf2pp._find_candidates
    - mapping.pop
    - <builtin>.min
    - <builtin>.dict
    - reverse_mapping.pop
    - u_labels_predecessors.keys
    - <builtin>.sorted
    - networkx.algorithms.isomorphism.vf2pp._find_candidates_Di
    - G1_degree.values
    - T1_in.add
    - common_nodes.intersection_update
    - u_labels_successors.items
    - T1.intersection
    - candidates.difference_update
    - G2.nodes
    - T1.update
    - T1.discard
    - networkx.utils.groups
    - <builtin>.len
    - T1_tilde.difference_update
    - networkx.algorithms.isomorphism.vf2pp._update_Tinout
    - networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms
    - stack.append
    - G2.number_of_nodes
    - networkx.algorithms.isomorphism.vf2pp._consistent_PT
    - T2.intersection
    - v_labels_predecessors.keys
    - G1.neighbors
    - G1.number_of_edges
    - G2_degree.values
    - T2.update
    - T1_tilde.add
    - T2_tilde.intersection
    - T1_in.intersection
    - T2.add
    - nodes_of_G2Labels.items
    - nodes_to_add.remove
    - networkx.algorithms.isomorphism.vf2pp._restore_Tinout_Di
    - T2_tilde.add
    - <builtin>.next
    - u_labels_successors.keys
    - T2_in.add
    - covered_predecessors.pop
    - T2_tilde.discard
    - G2.order
    - V1_unordered.discard
    - T2_tilde.difference_update
    - G2.number_of_edges
    - networkx.bfs_layers
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.order
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.order
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1_degree.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2_degree.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb5f850>
    - <ast.UnaryOp object at 0x7f734bb5fee0>
    argNames:
    - G1
    - G2
    - G2_degree
    - node_label
    - default_label
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 297
    functionName: networkx.algorithms.isomorphism.vf2pp._initialize_parameters
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - G2.nodes
    - G1.is_directed
    - networkx.utils.groups
    - <builtin>.dict
    - <builtin>.set
    - G1.nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph_params
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 287
    functionName: networkx.algorithms.isomorphism.vf2pp._precheck_label_properties
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - <builtin>.len
    - <builtin>.any
    - nodes_of_G2Labels.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - graph_params
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 375
    functionName: networkx.algorithms.isomorphism.vf2pp._matching_order
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - nodes_of_G2Labels.items
    - G1.is_directed
    - <builtin>.max
    - nodes_to_add.remove
    - <builtin>.min
    - <builtin>.len
    - <builtin>.set
    - V1_unordered.discard
    - G1.to_undirected
    - networkx.bfs_layers
    - G1.nodes
    - G1.neighbors
    - node_order.append
    - dlevel_nodes.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 10
    IfCount: 4
    argCount: 4
    argDefaultValues: []
    argNames:
    - u
    - graph_params
    - state_params
    - G1_degree
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 529
    functionName: networkx.algorithms.isomorphism.vf2pp._find_candidates_Di
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - candidates.difference_update
    - covered_predecessors.pop
    - G1.is_multigraph
    - G2.number_of_edges
    - candidates.intersection_update
    - common_nodes.intersection_update
    - common_nodes.difference_update
    - <builtin>.set
    - G1.number_of_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 10
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - u
    - graph_params
    - state_params
    - G1_degree
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 448
    functionName: networkx.algorithms.isomorphism.vf2pp._find_candidates
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - candidates.difference_update
    - G1.is_multigraph
    - G2.number_of_edges
    - candidates.intersection_update
    - common_nodes.intersection_update
    - common_nodes.difference_update
    - <builtin>.set
    - G1.number_of_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: reverse_mapping.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 9
    IfCount: 6
    argCount: 4
    argDefaultValues: []
    argNames:
    - popped_node1
    - popped_node2
    - graph_params
    - state_params
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 925
    functionName: networkx.algorithms.isomorphism.vf2pp._restore_Tinout
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - T1.discard
    - T1.add
    - T2.add
    - T2.discard
    - T2_tilde.add
    - <builtin>.any
    - T1_tilde.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 20
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 11
    EdgeCount: 29
    ICount: 18
    IfCount: 20
    argCount: 4
    argDefaultValues: []
    argNames:
    - popped_node1
    - popped_node2
    - graph_params
    - state_params
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1011
    functionName: networkx.algorithms.isomorphism.vf2pp._restore_Tinout_Di
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - T2_in.discard
    - T1.discard
    - T1.add
    - T1_in.add
    - T2.add
    - T2.discard
    - T1_in.discard
    - T2_tilde.add
    - T2_in.add
    - <builtin>.any
    - T1_tilde.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - node1
    - node2
    - graph_params
    - state_params
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 578
    functionName: networkx.algorithms.isomorphism.vf2pp._feasibility
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - T1_tilde.intersection
    - T2_tilde.intersection
    - G1.is_multigraph
    - <builtin>.sorted
    - <builtin>.zip
    - u_labels_predecessors.items
    - T1_in.intersection
    - u_labels_successors.items
    - T1.intersection
    - <builtin>.any
    - T2_in.intersection
    - networkx.utils.groups
    - <builtin>.len
    - <builtin>.set
    - u_labels_successors.keys
    - networkx.algorithms.isomorphism.vf2pp._cut_PT
    - G1.is_directed
    - networkx.algorithms.isomorphism.vf2pp._consistent_PT
    - v_labels_predecessors.keys
    - T2.intersection
    - G1.number_of_edges
    - v_labels_successors.keys
    - G2.number_of_edges
    - u_labels_predecessors.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mapping.copy
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 17
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - new_node1
    - new_node2
    - graph_params
    - state_params
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 831
    functionName: networkx.algorithms.isomorphism.vf2pp._update_Tinout
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 3
    functionsReached:
    - T2_in.discard
    - T1.update
    - T1_tilde.discard
    - T1.discard
    - G1.is_directed
    - T2.update
    - T2_in.update
    - T1_tilde.difference_update
    - T2.discard
    - T2_tilde.discard
    - T1_in.discard
    - T1_in.update
    - T2_tilde.difference_update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes_of_G2Labels.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.nodes
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.nodes
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.to_undirected
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dlevel_nodes.copy
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.vf2pp._matching_order.<lambda1>
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_order.append
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.neighbors
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes_to_add.remove
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: V1_unordered.discard
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: candidates.intersection_update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: candidates.difference_update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: common_nodes.intersection_update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: common_nodes.difference_update
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: covered_predecessors.pop
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 14
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 21
    ICount: 1
    IfCount: 14
    argCount: 4
    argDefaultValues: []
    argNames:
    - u
    - v
    - graph_params
    - state_params
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 635
    functionName: networkx.algorithms.isomorphism.vf2pp._cut_PT
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 4
    functionsReached:
    - T1_tilde.intersection
    - T2_tilde.intersection
    - G1.is_multigraph
    - <builtin>.sorted
    - <builtin>.zip
    - u_labels_predecessors.items
    - T1_in.intersection
    - u_labels_successors.items
    - T1.intersection
    - <builtin>.any
    - T2_in.intersection
    - networkx.utils.groups
    - <builtin>.len
    - <builtin>.set
    - u_labels_successors.keys
    - G1.is_directed
    - v_labels_predecessors.keys
    - T2.intersection
    - G1.number_of_edges
    - v_labels_successors.keys
    - G2.number_of_edges
    - u_labels_predecessors.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 1
    IfCount: 9
    argCount: 4
    argDefaultValues: []
    argNames:
    - u
    - v
    - graph_params
    - state_params
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 755
    functionName: networkx.algorithms.isomorphism.vf2pp._consistent_PT
    functionSourceFile: networkx.algorithms.isomorphism.vf2pp
    functionUses: 4
    functionsReached:
    - G1.is_directed
    - G1.number_of_edges
    - G2.number_of_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u_labels_predecessors.keys
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v_labels_predecessors.keys
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u_labels_successors.keys
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v_labels_successors.keys
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u_labels_successors.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1.intersection
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2.intersection
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_tilde.intersection
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_tilde.intersection
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_in.intersection
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_in.intersection
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u_labels_predecessors.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1.update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2.update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1.discard
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2.discard
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_tilde.difference_update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_tilde.difference_update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_tilde.discard
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_tilde.discard
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_in.update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_in.update
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_in.discard
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_in.discard
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_tilde.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_tilde.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T1_in.add
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T2_in.add
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.structuralholes
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd27ac0>
    argNames:
    - G
    - u
    - v
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 9
    functionName: networkx.algorithms.structuralholes.mutual_weight
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Name object at 0x7f734b691580>
    - <ast.Constant object at 0x7f734b6a8910>
    argNames:
    - G
    - u
    - v
    - norm
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 32
    functionName: networkx.algorithms.structuralholes.normalized_mutual_weight
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 4
    functionsReached:
    - <builtin>.set
    - networkx.all_neighbors
    - networkx.algorithms.structuralholes.mutual_weight
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc8880>
    - <ast.Constant object at 0x7f734cfc8a90>
    argNames:
    - G
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 53
    functionName: networkx.algorithms.structuralholes.effective_size
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 0
    functionsReached:
    - effective_size.tolist
    - <builtin>.zip
    - <builtin>.sum
    - networkx.all_neighbors
    - <builtin>.all
    - networkx.ego_graph
    - mutual_weights2.max
    - networkx.algorithms.structuralholes.normalized_mutual_weight
    - mutual_weights1.copy
    - mutual_weights1.sum
    - networkx.adjacency_matrix
    - <builtin>.len
    - <builtin>.set
    - G.is_directed
    - networkx.algorithms.structuralholes.effective_size.redundancy
    - <builtin>.float
    - E.size
    - numpy.errstate
    - <builtin>.dict
    - networkx.algorithms.structuralholes.mutual_weight
    - mutual_weights1.diagonal
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26070>
    argNames:
    - G
    - u
    - v
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 141
    functionName: networkx.algorithms.structuralholes.effective_size.redundancy
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 1
    functionsReached:
    - networkx.algorithms.structuralholes.normalized_mutual_weight
    - <builtin>.sum
    - <builtin>.set
    - networkx.all_neighbors
    - networkx.algorithms.structuralholes.mutual_weight
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutual_weights1.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutual_weights1.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutual_weights2.max
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutual_weights1.diagonal
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: effective_size.tolist
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.ego_graph
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: E.size
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd48d90>
    - <ast.Constant object at 0x7f734cd48a00>
    argNames:
    - G
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 218
    functionName: networkx.algorithms.structuralholes.constraint
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 0
    functionsReached:
    - numpy.errstate
    - networkx.algorithms.structuralholes.normalized_mutual_weight
    - <builtin>.zip
    - networkx.algorithms.structuralholes.local_constraint
    - <builtin>.sum
    - networkx.adjacency_matrix
    - <builtin>.dict
    - <builtin>.len
    - <builtin>.set
    - networkx.all_neighbors
    - constraints.tolist
    - <builtin>.float
    - mutual_weights.diagonal
    - networkx.algorithms.structuralholes.mutual_weight
    - mutual_weights.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutual_weights.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mutual_weights.diagonal
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: constraints.tolist
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb6e20>
    argNames:
    - G
    - u
    - v
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 318
    functionName: networkx.algorithms.structuralholes.local_constraint
    functionSourceFile: networkx.algorithms.structuralholes
    functionUses: 1
    functionsReached:
    - networkx.algorithms.structuralholes.normalized_mutual_weight
    - <builtin>.sum
    - <builtin>.set
    - networkx.all_neighbors
    - networkx.algorithms.structuralholes.mutual_weight
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.summarization
    functionSourceFile: networkx.algorithms.summarization
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 6
    IfCount: 7
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73493c8940>
    - <ast.Constant object at 0x7f73493c8910>
    argNames:
    - G
    - threshold
    - prefix
    - copy
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 70
    functionName: networkx.algorithms.summarization.dedensify
    functionSourceFile: networkx.algorithms.summarization
    functionUses: 0
    functionsReached:
    - G.is_directed
    - compressor_nodes.add
    - G.add_edge
    - G.nodes
    - <builtin>.frozenset
    - G.remove_edge
    - <builtin>.len
    - G.has_edge
    - G.copy
    - <builtin>.set
    - <builtin>.str
    - <builtin>.enumerate
    - auxiliary.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: auxiliary.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: compressor_nodes.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 9
    argDefaultValues: []
    argNames:
    - G
    - groups
    - node_attributes
    - edge_attributes
    - neighbor_info
    - edge_types
    - prefix
    - supernode_attribute
    - superedge_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 217
    functionName: networkx.algorithms.summarization._snap_build_graph
    functionSourceFile: networkx.algorithms.summarization
    functionUses: 1
    functionsReached:
    - output.is_multigraph
    - output.get_edge_data
    - output.has_edge
    - output.add_node
    - <builtin>.zip
    - G.__class__
    - output.is_directed
    - <builtin>.iter
    - <builtin>.dict
    - <builtin>.enumerate
    - <builtin>.next
    - existing_edge_data.values
    - output.add_edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: output.add_node
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: output.has_edge
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: output.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: output.add_edge
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: output.is_directed
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: output.get_edge_data
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: existing_edge_data.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - groups
    - group_lookup
    - edge_types
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 307
    functionName: networkx.algorithms.summarization._snap_eligible_group
    functionSourceFile: networkx.algorithms.summarization
    functionUses: 1
    functionsReached:
    - collections.Counter
    - collections.Counter.values
    - collections.Counter.update
    - <builtin>.len
    - G.is_multigraph
    - <builtin>.all
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter.update
    functionSourceFile: collections
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - groups
    - neighbor_info
    - group_lookup
    - group_id
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 359
    functionName: networkx.algorithms.summarization._snap_split
    functionSourceFile: networkx.algorithms.summarization
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - <builtin>.sorted
    - <builtin>.tuple
    - <builtin>.len
    - collections.defaultdict.values
    - <builtin>.frozenset
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Tuple object at 0x7f734cc98bb0>
    - <ast.Constant object at 0x7f734cc98280>
    - <ast.Constant object at 0x7f734cc98ca0>
    - <ast.Constant object at 0x7f734cc98460>
    argNames:
    - G
    - node_attributes
    - edge_attributes
    - prefix
    - supernode_attribute
    - superedge_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 411
    functionName: networkx.algorithms.summarization.snap_aggregation
    functionSourceFile: networkx.algorithms.summarization
    functionUses: 0
    functionsReached:
    - attrs.get
    - <builtin>.sorted
    - output.get_edge_data
    - <builtin>.zip
    - G.__class__
    - <builtin>.enumerate
    - <builtin>.all
    - output.is_multigraph
    - output.is_directed
    - <builtin>.len
    - collections.defaultdict.values
    - <builtin>.next
    - <builtin>.frozenset
    - G.is_directed
    - G.edges.items
    - group_lookup.items
    - output.add_node
    - <builtin>.tuple
    - networkx.algorithms.summarization._snap_build_graph
    - <builtin>.iter
    - collections.Counter.update
    - G.is_multigraph
    - G.nodes.items
    - collections.Counter
    - output.add_edge
    - G.edges
    - collections.defaultdict
    - existing_edge_data.values
    - networkx.algorithms.summarization._snap_eligible_group
    - edge_types.update
    - output.has_edge
    - collections.Counter.values
    - edge_types.items
    - <builtin>.dict
    - networkx.algorithms.summarization._snap_split
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attrs.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.edges.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_types.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge_types.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: group_lookup.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.isolate
    functionSourceFile: networkx.algorithms.isolate
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.simple_paths
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - source
    - targets
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 380
    functionName: networkx.algorithms.simple_paths._all_simple_edge_paths
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 192
    functionsReached:
    - stack.append
    - current_path.values
    - current_path.popitem
    - stack.pop
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.len
    - G.is_multigraph
    - <builtin>.next
    - current_path.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.simple_paths._all_simple_edge_paths.<lambda1>
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 0
    functionsReached:
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.simple_paths._all_simple_edge_paths.<lambda2>
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 0
    functionsReached:
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: current_path.popitem
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: current_path.values
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: current_path.keys
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 7
    IfCount: 6
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90c40>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 424
    functionName: networkx.algorithms.simple_paths.shortest_simple_paths
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 0
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate
    - <builtin>.zip
    - heapq.heappop
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    - <builtin>.sum
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - path.insert
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate
    - revpath.reverse
    - data.get
    - <builtin>.len
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    - networkx.algorithms.simple_paths.PathBuffer.push
    - <builtin>.next
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - networkx.algorithms.simple_paths._bidirectional_dijkstra
    - G.is_directed
    - networkx.algorithms.simple_paths.shortest_simple_paths.length_func
    - G.get_edge_data
    - networkx.algorithms.simple_paths.PathBuffer.pop
    - <builtin>.tuple
    - itertools.count
    - networkx.algorithms.simple_paths.PathBuffer.__init__
    - <builtin>.callable
    - heapq.heappush
    - networkx.algorithms.simple_paths._bidirectional_pred_succ
    - listA.append
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter
    - <builtin>.range
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter
    - networkx.algorithms.simple_paths._bidirectional_shortest_path
    - ignore_nodes.add
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate
    - reverse_fringe.append
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter
    - ignore_edges.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 526
    functionName: networkx.algorithms.simple_paths.shortest_simple_paths.length_func
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 1
    functionsReached:
    - G.get_edge_data
    - d.values
    - <builtin>.zip
    - <builtin>.min
    - <builtin>.sum
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - data.get
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 574
    functionName: networkx.algorithms.simple_paths.PathBuffer.__init__
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 1
    functionsReached:
    - <builtin>.set
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734c3fb4f0>
    - <ast.Constant object at 0x7f734c3fb1f0>
    - <ast.Constant object at 0x7f734d4b0310>
    argNames:
    - G
    - source
    - target
    - ignore_nodes
    - ignore_edges
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 595
    functionName: networkx.algorithms.simple_paths._bidirectional_shortest_path
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 1
    functionsReached:
    - G.is_directed
    - path.insert
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter
    - path.append
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    - <builtin>.len
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter
    - networkx.algorithms.simple_paths._bidirectional_pred_succ
    - reverse_fringe.append
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 16
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 23
    ICount: 5
    IfCount: 16
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f190>
    - <ast.Constant object at 0x7f734b06f7f0>
    - <ast.Constant object at 0x7f734b06f490>
    argNames:
    - G
    - source
    - target
    - weight
    - ignore_nodes
    - ignore_edges
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 763
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 1
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - revpath.reverse
    - data.get
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - G.is_directed
    - G.get_edge_data
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter
    - d.values
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - <builtin>.min
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - cost
    - path
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 582
    functionName: networkx.algorithms.simple_paths.PathBuffer.push
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 1
    functionsReached:
    - <builtin>.next
    - <builtin>.tuple
    - heapq.heappush
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ignore_edges.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ignore_nodes.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 588
    functionName: networkx.algorithms.simple_paths.PathBuffer.pop
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 1
    functionsReached:
    - heapq.heappop
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: listA.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 579
    functionName: networkx.algorithms.simple_paths.PathBuffer.__len__
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 3
    IfCount: 11
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccd6040>
    - <ast.Constant object at 0x7f734ccd6070>
    argNames:
    - G
    - source
    - target
    - ignore_nodes
    - ignore_edges
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 658
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 2
    functionsReached:
    - G.is_directed
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    - <builtin>.len
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter
    - reverse_fringe.append
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: path.insert
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - nodes
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 717
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 718
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 5
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 697
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 5
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 705
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 5
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - pred_iter
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 696
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - succ_iter
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 704
    functionName: networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - nodes
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 895
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 896
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 4
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 883
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 4
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 875
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 4
    functionsReached:
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate
    - networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - pred_iter
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 874
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - succ_iter
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 882
    functionName: networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter
    functionSourceFile: networkx.algorithms.simple_paths
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: revpath.reverse
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.weighted
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr.get
    functionSourceFile: <builtin>
    functionUses: 252
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.values
    functionSourceFile: <builtin>
    functionUses: 38
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a40ca90>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 82
    functionName: networkx.algorithms.shortest_paths.weighted.dijkstra_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7344fc81f0>
    - <ast.Constant object at 0x7f7344fc81c0>
    - <ast.Constant object at 0x7f7344fc8190>
    argNames:
    - G
    - source
    - target
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 393
    functionName: networkx.algorithms.shortest_paths.weighted.single_source_dijkstra
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 2
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a40c4f0>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 176
    functionName: networkx.algorithms.shortest_paths.weighted.dijkstra_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - networkx.algorithms.shortest_paths.weighted._dijkstra
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbbacd0>
    - <ast.Constant object at 0x7f734cbba970>
    - <ast.Constant object at 0x7f734cbbabb0>
    - <ast.Constant object at 0x7f734cbba790>
    argNames:
    - G
    - source
    - weight
    - pred
    - paths
    - cutoff
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 770
    functionName: networkx.algorithms.shortest_paths.weighted._dijkstra
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 4
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - d.values
    - path.append
    - heapq.heappop
    - <builtin>.min
    - itertools.count
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - <builtin>.len
    - path.reverse
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - data.get
    - heapq.heappush
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - attr.get
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - <builtin>.next
    - pred_dict.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a403040>
    - <ast.Constant object at 0x7f7344fccfd0>
    argNames:
    - G
    - source
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 256
    functionName: networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41c70>
    - <ast.Constant object at 0x7f734cd41490>
    argNames:
    - G
    - sources
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 495
    functionName: networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 2
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7344fccac0>
    - <ast.Constant object at 0x7f7344fcca90>
    argNames:
    - G
    - source
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 321
    functionName: networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 5
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c8de850>
    - <ast.Constant object at 0x7f734c8de7c0>
    argNames:
    - G
    - sources
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 569
    functionName: networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 6
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d38c3d0>
    - <ast.Constant object at 0x7f734d38cb20>
    - <ast.Constant object at 0x7f734d38c910>
    argNames:
    - G
    - sources
    - target
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 651
    functionName: networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 6
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 7
    IfCount: 12
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734a478e50>
    - <ast.Constant object at 0x7f734a4783a0>
    - <ast.Constant object at 0x7f734a4783d0>
    - <ast.Constant object at 0x7f734a478250>
    argNames:
    - G
    - sources
    - weight
    - pred
    - paths
    - cutoff
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 784
    functionName: networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 19
    functionsReached:
    - d.values
    - path.append
    - heapq.heappop
    - <builtin>.min
    - itertools.count
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - <builtin>.len
    - path.reverse
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - data.get
    - heapq.heappush
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - attr.get
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - <builtin>.next
    - pred_dict.get
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - u
    - v
    - d
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 2534
    functionName: networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    functionSourceFile: ''
    functionUses: 20
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pred_dict.get
    functionSourceFile: <builtin>
    functionUses: 20
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f280>
    - <ast.Constant object at 0x7f734b06f460>
    argNames:
    - G
    - source
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 911
    functionName: networkx.algorithms.shortest_paths.weighted.dijkstra_predecessor_and_distance
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - networkx.algorithms.shortest_paths.weighted._dijkstra
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63d0a0>
    - <ast.Constant object at 0x7f734d63d0d0>
    argNames:
    - G
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 984
    functionName: networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4b20>
    - <ast.Constant object at 0x7f734b5c4d60>
    argNames:
    - G
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 1053
    functionName: networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - <builtin>.iter
    - <builtin>.callable
    - heapq.heappush
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23130>
    - <ast.Constant object at 0x7f734cc23b20>
    argNames:
    - G
    - cutoff
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1112
    functionName: networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - data.get
    - <builtin>.len
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbd7340>
    - <ast.Constant object at 0x7f734cbd7610>
    - <ast.Constant object at 0x7f734cbd7280>
    argNames:
    - G
    - source
    - target
    - weight
    - heuristic
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1166
    functionName: networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - <builtin>.any
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - networkx.selfloop_edges
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734d612670>
    - <ast.Constant object at 0x7f734d612970>
    - <ast.Constant object at 0x7f734d612040>
    - <ast.Constant object at 0x7f734d612dc0>
    - <ast.Constant object at 0x7f734b6b0100>
    argNames:
    - G
    - source
    - weight
    - pred
    - paths
    - dist
    - target
    - heuristic
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1295
    functionName: networkx.algorithms.shortest_paths.weighted._bellman_ford
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 14
    functionsReached:
    - dist.get
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.float
    - seen.discard
    - collections.deque
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 6
    IfCount: 11
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b783460>
    - <ast.Constant object at 0x7f734b783b20>
    argNames:
    - G
    - sources
    - weight
    - pred
    - dist
    - heuristic
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1389
    functionName: networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 16
    functionsReached:
    - collections.deque.append
    - dist.get
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - <builtin>.len
    - collections.deque.popleft
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - <builtin>.float
    - <builtin>.all
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - data.get
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 3
    argDefaultValues: []
    argNames:
    - sources
    - target
    - pred
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 652
    functionName: networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 18
    functionsReached:
    - stack.append
    - <builtin>.reversed
    - <builtin>.len
    - seen.add
    - seen.discard
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_q.remove
    functionSourceFile: <builtin>
    functionUses: 17
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dist.get
    functionSourceFile: <builtin>
    functionUses: 17
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_q.add
    functionSourceFile: <builtin>
    functionUses: 17
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: count.get
    functionSourceFile: <builtin>
    functionUses: 17
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90850>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 1514
    functionName: networkx.algorithms.shortest_paths.weighted.bellman_ford_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf3d0>
    - <ast.Constant object at 0x7f734a4cf9a0>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1763
    functionName: networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 3
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc901c0>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1573
    functionName: networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e130>
    argNames:
    - G
    - source
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 1644
    functionName: networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf550>
    argNames:
    - G
    - source
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1700
    functionName: networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 5
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb070>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 1857
    functionName: networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length
    - <builtin>.next
    - stack.append
    - <builtin>.iter
    - <builtin>.callable
    - <builtin>.float
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcba30>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1912
    functionName: networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - stack.append
    - <builtin>.callable
    - <builtin>.float
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8400>
    argNames:
    - G
    - source
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1961
    functionName: networkx.algorithms.shortest_paths.weighted.goldberg_radzik
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - neg_count.keys
    - in_stack.remove
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - to_scan.append
    - <builtin>.all
    - <builtin>.any
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - in_stack.add
    - <builtin>.next
    - stack.append
    - to_scan.reverse
    - networkx.algorithms.shortest_paths.weighted.goldberg_radzik.relax
    - <builtin>.iter
    - relabeled.add
    - G.is_multigraph
    - <builtin>.callable
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.shortest_paths.weighted.goldberg_radzik.topo_sort
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 7
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - relabeled
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2064
    functionName: networkx.algorithms.shortest_paths.weighted.goldberg_radzik.topo_sort
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - stack.append
    - neg_count.keys
    - to_scan.reverse
    - in_stack.remove
    - stack.pop
    - to_scan.append
    - <builtin>.iter
    - in_stack.add
    - <builtin>.all
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neg_count.keys
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: to_scan.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_stack.remove
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_stack.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: to_scan.reverse
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - to_scan
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2116
    functionName: networkx.algorithms.shortest_paths.weighted.goldberg_radzik.relax
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - relabeled.add
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: relabeled.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a440760>
    - <ast.Constant object at 0x7f734a440730>
    argNames:
    - G
    - weight
    - heuristic
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 2144
    functionName: networkx.algorithms.shortest_paths.weighted.negative_edge_cycle
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.sum
    - <builtin>.all
    - seen.add
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - attr.get
    - <builtin>.next
    - stack.append
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - <builtin>.callable
    - networkx.selfloop_edges
    - <builtin>.float
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - networkx.classes.graph.Graph.nbunch_iter
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 7
    IfCount: 6
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73462d2940>
    argNames:
    - G
    - source
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 2215
    functionName: networkx.algorithms.shortest_paths.weighted.find_negative_cycle
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.all
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - <builtin>.reversed
    - stack.pop
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - stack.append
    - neg_cycle.append
    - <builtin>.list
    - <builtin>.callable
    - <builtin>.float
    - preds.pop
    - collections.deque
    - d.values
    - in_q.add
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - collections.deque.popleft
    - neg_cycle.pop
    - neg_cycle.extend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neg_cycle.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: preds.pop
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neg_cycle.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neg_cycle.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 4
    IfCount: 12
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73462f1820>
    argNames:
    - G
    - source
    - target
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 2310
    functionName: networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.path
    - <builtin>.reversed
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.list
    - ret.append
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - <builtin>.next
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - curr
    - direction
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 2401
    functionName: networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - ret.append
    - <builtin>.reversed
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ret.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7347fbb1c0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 2463
    functionName: networkx.algorithms.shortest_paths.weighted.johnson
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 0
    functionsReached:
    - dist.get
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - path.reverse
    - itertools.islice
    - <builtin>.all
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - data.get
    - <builtin>.len
    - in_q.remove
    - <builtin>.set
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.shortest_paths.weighted._inner_bellman_ford
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - stack.append
    - <builtin>.list
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - <builtin>.float
    - networkx.algorithms.shortest_paths.weighted._dijkstra
    - seen.discard
    - collections.deque
    - networkx.algorithms.shortest_paths.weighted._bellman_ford
    - d.values
    - in_q.add
    - path.append
    - count.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    - networkx.algorithms.shortest_paths.weighted.johnson.dist_path
    - collections.deque.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 2537
    functionName: networkx.algorithms.shortest_paths.weighted.johnson.dist_path
    functionSourceFile: networkx.algorithms.shortest_paths.weighted
    functionUses: 1
    functionsReached:
    - networkx.algorithms.shortest_paths.weighted._dijkstra_multisource
    - heapq.heappop
    - path.reverse
    - itertools.islice
    - networkx.algorithms.shortest_paths.weighted.johnson.new_weight
    - data.get
    - <builtin>.len
    - attr.get
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>
    - networkx.algorithms.bridges.local_bridges.hide_edge
    - <builtin>.next
    - pred_dict.get
    - itertools.count
    - heapq.heappush
    - networkx.algorithms.shortest_paths.weighted._dijkstra
    - d.values
    - path.append
    - <builtin>.min
    - networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.generic
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 1
    IfCount: 13
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23df0>
    - <ast.Constant object at 0x7f734cc23940>
    - <ast.Constant object at 0x7f734cc23730>
    - <ast.Constant object at 0x7f734cc237c0>
    argNames:
    - G
    - source
    - target
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 43
    functionName: networkx.algorithms.shortest_paths.generic.shortest_path
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.bidirectional_shortest_path
    - G.reverse
    - networkx.single_source_bellman_ford_path
    - networkx.bidirectional_dijkstra
    - <builtin>.reversed
    - <builtin>.list
    - networkx.single_source_shortest_path
    - networkx.all_pairs_shortest_path
    - networkx.all_pairs_bellman_ford_path
    - networkx.bellman_ford_path
    - networkx.all_pairs_dijkstra_path
    - networkx.single_source_dijkstra_path
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_shortest_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_dijkstra_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_bellman_ford_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_shortest_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_dijkstra_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_bellman_ford_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bidirectional_shortest_path
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bidirectional_dijkstra
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bellman_ford_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_shortest_path_length
    functionSourceFile: ''
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_dijkstra_path_length
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_pairs_bellman_ford_path_length
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dijkstra_path_length
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bellman_ford_path_length
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 1
    IfCount: 9
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16250>
    - <ast.Constant object at 0x7f734ab16a90>
    argNames:
    - G
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 326
    functionName: networkx.algorithms.shortest_paths.generic.average_shortest_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.floyd_warshall
    - t.values
    - networkx.is_connected
    - <builtin>.sum
    - networkx.is_strongly_connected
    - <builtin>.len
    - networkx.single_source_dijkstra_path_length
    - networkx.algorithms.shortest_paths.generic.average_shortest_path_length.path_length
    - <builtin>.float
    - all_pairs.values
    - networkx.single_source_shortest_path_length
    - networkx.floyd_warshall_numpy
    - networkx.single_source_bellman_ford_path_length
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 421
    functionName: networkx.algorithms.shortest_paths.generic.average_shortest_path_length.path_length
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 1
    functionsReached:
    - networkx.single_source_dijkstra_path_length
    - networkx.single_source_shortest_path_length
    - networkx.single_source_bellman_ford_path_length
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_dijkstra_path_length
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.single_source_bellman_ford_path_length
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.floyd_warshall
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: t.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: all_pairs.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.floyd_warshall_numpy
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90970>
    - <ast.Constant object at 0x7f734bc90c70>
    argNames:
    - G
    - source
    - target
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 442
    functionName: networkx.algorithms.shortest_paths.generic.all_shortest_paths
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 0
    functionsReached:
    - stack.append
    - seen.add
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - <builtin>.len
    - networkx.dijkstra_predecessor_and_distance
    - networkx.bellman_ford_predecessor_and_distance
    - networkx.predecessor
    - seen.discard
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.predecessor
    functionSourceFile: ''
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dijkstra_predecessor_and_distance
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.bellman_ford_predecessor_and_distance
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d425340>
    - <ast.Constant object at 0x7f734d4254f0>
    argNames:
    - G
    - source
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 520
    functionName: networkx.algorithms.shortest_paths.generic.single_source_all_shortest_paths
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 1
    functionsReached:
    - stack.append
    - seen.add
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - <builtin>.list
    - <builtin>.len
    - networkx.dijkstra_predecessor_and_distance
    - networkx.bellman_ford_predecessor_and_distance
    - networkx.predecessor
    - seen.discard
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734caeeb50>
    - <ast.Constant object at 0x7f734caee430>
    argNames:
    - G
    - weight
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 593
    functionName: networkx.algorithms.shortest_paths.generic.all_pairs_all_shortest_paths
    functionSourceFile: networkx.algorithms.shortest_paths.generic
    functionUses: 0
    functionsReached:
    - stack.append
    - seen.add
    - networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors
    - <builtin>.reversed
    - <builtin>.list
    - <builtin>.dict
    - networkx.dijkstra_predecessor_and_distance
    - <builtin>.len
    - networkx.bellman_ford_predecessor_and_distance
    - networkx.algorithms.shortest_paths.generic.single_source_all_shortest_paths
    - networkx.predecessor
    - seen.discard
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen.discard
    functionSourceFile: <builtin>
    functionUses: 19
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.core
    functionSourceFile: networkx.algorithms.core
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.utils.not_implemented_for
    - networkx.contracted_edge
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bin_boundaries.extend
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7e220>
    - <ast.Constant object at 0x7f734bb7ecd0>
    argNames:
    - G
    - k_filter
    - k
    - core
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 125
    functionName: networkx.algorithms.core._core_subgraph
    functionSourceFile: networkx.algorithms.core
    functionUses: 4
    functionsReached:
    - networkx.algorithms.core.k_core.k_filter
    - <builtin>.sorted
    - G.subgraph
    - <builtin>.max
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.dict
    - networkx.algorithms.core.core_number
    - networkx.algorithms.core.k_shell.k_filter
    - bin_boundaries.extend
    - networkx.all_neighbors
    - networkx.number_of_selfloops
    - <builtin>.enumerate
    - networkx.algorithms.core.k_corona.func
    - G.degree
    - core.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: core.values
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - v
    - k
    - c
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 207
    functionName: networkx.algorithms.core.k_core.k_filter
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - v
    - k
    - c
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 274
    functionName: networkx.algorithms.core.k_shell.k_filter
    functionSourceFile: ''
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - v
    - k
    - c
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 403
    functionName: networkx.algorithms.core.k_corona.func
    functionSourceFile: networkx.algorithms.core
    functionUses: 5
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba610>
    - <ast.Constant object at 0x7f734aaa8040>
    argNames:
    - G
    - k
    - core_number
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 215
    functionName: networkx.algorithms.core.k_shell
    functionSourceFile: networkx.algorithms.core
    functionUses: 0
    functionsReached:
    - networkx.algorithms.core.k_core.k_filter
    - <builtin>.sorted
    - G.subgraph
    - <builtin>.max
    - <builtin>.list
    - <builtin>.sum
    - networkx.algorithms.core._core_subgraph
    - networkx.algorithms.core.core_number
    - <builtin>.dict
    - networkx.algorithms.core.k_shell.k_filter
    - bin_boundaries.extend
    - networkx.all_neighbors
    - networkx.number_of_selfloops
    - <builtin>.enumerate
    - G.degree
    - networkx.algorithms.core.k_corona.func
    - core.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8880>
    - <ast.Constant object at 0x7f734aaa82b0>
    argNames:
    - G
    - k
    - core_number
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 282
    functionName: networkx.algorithms.core.k_crust
    functionSourceFile: networkx.algorithms.core
    functionUses: 0
    functionsReached:
    - <builtin>.max
    - G.subgraph
    - core_number.values
    - networkx.core_number
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: core_number.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3f40>
    argNames:
    - G
    - k
    - core_number
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 349
    functionName: networkx.algorithms.core.k_corona
    functionSourceFile: networkx.algorithms.core
    functionUses: 0
    functionsReached:
    - networkx.algorithms.core.k_core.k_filter
    - <builtin>.sorted
    - G.subgraph
    - <builtin>.max
    - <builtin>.list
    - <builtin>.sum
    - networkx.algorithms.core._core_subgraph
    - networkx.algorithms.core.core_number
    - <builtin>.dict
    - networkx.algorithms.core.k_shell.k_filter
    - bin_boundaries.extend
    - networkx.all_neighbors
    - networkx.number_of_selfloops
    - <builtin>.enumerate
    - G.degree
    - networkx.algorithms.core.k_corona.func
    - core.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 412
    functionName: networkx.algorithms.core.k_truss
    functionSourceFile: networkx.algorithms.core
    functionUses: 0
    functionsReached:
    - H.remove_edges_from
    - networkx.isolates
    - <builtin>.list
    - <builtin>.len
    - G.copy
    - <builtin>.set
    - networkx.number_of_selfloops
    - seen.add
    - to_drop.append
    - H.remove_nodes_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: to_drop.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.isolates
    functionSourceFile: ''
    functionUses: 204
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degrees.pop
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: this_layer.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.community
    functionSourceFile: networkx.algorithms.community
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.louvain
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7345486160>
    - <ast.Constant object at 0x7f7345486130>
    - <ast.Constant object at 0x7f7345486100>
    - <ast.Constant object at 0x7f73454860d0>
    - <ast.Constant object at 0x7f73454860a0>
    argNames:
    - G
    - weight
    - resolution
    - threshold
    - max_level
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 16
    functionName: networkx.algorithms.community.louvain.louvain_communities
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 0
    functionsReached:
    - networkx.algorithms.community.louvain._neighbor_weights
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - nbrs.items
    - networkx.algorithms.community.louvain.louvain_partitions
    - networkx.algorithms.community.quality.modularity
    - <builtin>.filter
    - itertools.islice
    - out_degrees.values
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - G.is_multigraph
    - collections.defaultdict
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.is_empty
    - collections.deque.pop
    - nodes.update
    - collections.defaultdict.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - H.add_node
    - networkx.classes.reportviews.OutEdgeView.__iter__
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.community.louvain._convert_multigraph
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.classes.digraph.DiGraph.is_directed
    - H.add_edge
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - degrees.values
    - s.copy
    - H.get_edge_data
    - networkx._clear_cache
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.in_degree
    - out_degree.values
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - seed.shuffle
    - G.edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - G.nodes
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.classes.reportviews.NodeView.__init__
    - <builtin>.enumerate
    - <builtin>.map
    - networkx.classes.reportviews.OutEdgeView.__init__
    - in_degrees.values
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.community.louvain._one_level
    - <builtin>.list
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - collections.deque
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.community.louvain._gen_graph
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06640>
    - <ast.Constant object at 0x7f734bc06100>
    - <ast.Constant object at 0x7f734bc06b20>
    - <ast.Constant object at 0x7f734bc060d0>
    argNames:
    - G
    - weight
    - resolution
    - threshold
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 135
    functionName: networkx.algorithms.community.louvain.louvain_partitions
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 1
    functionsReached:
    - networkx.algorithms.community.louvain._neighbor_weights
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - nbrs.items
    - networkx.algorithms.community.quality.modularity
    - <builtin>.filter
    - out_degrees.values
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - G.is_multigraph
    - collections.defaultdict
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.is_empty
    - nodes.update
    - collections.defaultdict.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - H.add_node
    - networkx.classes.reportviews.OutEdgeView.__iter__
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.community.louvain._convert_multigraph
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.classes.digraph.DiGraph.is_directed
    - H.add_edge
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - degrees.values
    - s.copy
    - H.get_edge_data
    - networkx._clear_cache
    - G.__class__
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.in_degree
    - out_degree.values
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - seed.shuffle
    - G.edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - G.nodes
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.classes.reportviews.NodeView.__init__
    - <builtin>.enumerate
    - <builtin>.map
    - networkx.classes.reportviews.OutEdgeView.__init__
    - in_degrees.values
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.community.louvain._one_level
    - <builtin>.list
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.community.louvain._gen_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba443d0>
    - <ast.Constant object at 0x7f734ba44880>
    argNames:
    - G
    - communities
    - weight
    - resolution
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 145
    functionName: networkx.algorithms.community.quality.modularity
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 3
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - <builtin>.map
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - out_degree.values
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.community.community_utils.is_partition
    linkageType: pythonLinkage
    raised:
    - NotAPartition
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - weight
    - is_directed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 372
    functionName: networkx.algorithms.community.louvain._convert_multigraph
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 2
    functionsReached:
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx._clear_cache
    - attr.copy
    - keydict.get
    - <builtin>.iter
    - newdict.update
    - <builtin>.len
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.graph.Graph.has_edge
    - G.edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 6
    IfCount: 8
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf34c0>
    - <ast.Constant object at 0x7f734caf3370>
    - <ast.Constant object at 0x7f734caf3670>
    argNames:
    - G
    - m
    - partition
    - resolution
    - is_directed
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 227
    functionName: networkx.algorithms.community.louvain._one_level
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 2
    functionsReached:
    - networkx.algorithms.community.louvain._neighbor_weights
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - collections.defaultdict.items
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.enumerate
    - <builtin>.filter
    - out_degrees.values
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - in_degrees.values
    - networkx.classes.multigraph.MultiGraph.degree
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.reportviews.OutEdgeView.__iter__
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - seed.shuffle
    - collections.defaultdict
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - degrees.values
    - networkx.classes.reportviews.NodeView.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: s.copy
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 352
    functionName: networkx.algorithms.community.louvain._gen_graph
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 2
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - G.__class__
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - H.add_edge
    - <builtin>.set
    - <builtin>.enumerate
    - nodes.update
    - H.add_node
    - H.get_edge_data
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_degrees.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: out_degrees.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degrees.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - nbrs
    - node2com
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 335
    functionName: networkx.algorithms.community.louvain._neighbor_weights
    functionSourceFile: networkx.algorithms.community.louvain
    functionUses: 3
    functionsReached:
    - collections.defaultdict
    - nbrs.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.filter
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.add_node
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.get_edge_data
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.community.local
    functionSourceFile: networkx.algorithms.community.local
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - source
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 26
    functionName: networkx.algorithms.community.local._clauset_greedy_source_expansion
    functionSourceFile: networkx.algorithms.community.local
    functionUses: 1
    functionsReached:
    - U.update
    - B_tmp.remove
    - I.copy
    - <builtin>.all
    - removed_B_nodes.add
    - <builtin>.any
    - I_tmp.discard
    - B_tmp.add
    - T_tmp.discard
    - <builtin>.len
    - I_tmp.add
    - <builtin>.set
    - networkx.algorithms.community.local._calculate_local_modularity_for_candidate
    - <builtin>.frozenset
    - B.copy
    - <builtin>.float
    - U.remove
    - G.neighbors
    - T_tmp.add
    - T.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 8
    IfCount: 5
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - v
    - C
    - B
    - T
    - I
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 68
    functionName: networkx.algorithms.community.local._calculate_local_modularity_for_candidate
    functionSourceFile: networkx.algorithms.community.local
    functionUses: 2
    functionsReached:
    - B.copy
    - I_tmp.discard
    - B_tmp.add
    - T_tmp.discard
    - T.copy
    - T_tmp.add
    - I_tmp.add
    - <builtin>.len
    - <builtin>.set
    - B_tmp.remove
    - I.copy
    - removed_B_nodes.add
    - <builtin>.frozenset
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: U.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B.copy
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.copy
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: I.copy
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B_tmp.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T_tmp.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B_tmp.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: removed_B_nodes.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: I_tmp.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T_tmp.discard
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: I_tmp.discard
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - source
    - cutoff
    - method
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 140
    functionName: networkx.algorithms.community.local.greedy_source_expansion
    functionSourceFile: networkx.algorithms.community.local
    functionUses: 0
    functionsReached:
    - U.update
    - B_tmp.remove
    - I.copy
    - <builtin>.all
    - removed_B_nodes.add
    - networkx.algorithms.community.local._clauset_greedy_source_expansion
    - <builtin>.any
    - I_tmp.discard
    - B_tmp.add
    - T_tmp.discard
    - <builtin>.len
    - I_tmp.add
    - <builtin>.set
    - networkx.algorithms.community.local._calculate_local_modularity_for_candidate
    - <builtin>.frozenset
    - B.copy
    - <builtin>.float
    - U.remove
    - G.neighbors
    - T_tmp.add
    - T.copy
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.kernighan_lin
    functionSourceFile: networkx.algorithms.community.kernighan_lin
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - edges
    - side
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 12
    functionName: networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep
    functionSourceFile: networkx.algorithms.community.kernighan_lin
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - networkx.utils.heaps.BinaryHeap.pop
    - heapq.heappop
    - networkx.utils.heaps.BinaryHeap.__init__
    - costs_y.insert
    - <builtin>.sum
    - networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep._update_costs
    - costs_y.get
    - <builtin>.super
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - costs_x
    - x
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 23
    functionName: networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep._update_costs
    functionSourceFile: networkx.algorithms.community.kernighan_lin
    functionUses: 2
    functionsReached:
    - costs_y.get
    - costs_y.insert
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: costs_y.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: costs_y.insert
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc17850>
    - <ast.Constant object at 0x7f734cf1dfd0>
    - <ast.Constant object at 0x7f734cf1d400>
    - <ast.Constant object at 0x7f734bc06730>
    argNames:
    - G
    - partition
    - max_iter
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 46
    functionName: networkx.algorithms.community.kernighan_lin.kernighan_lin_bisection
    functionSourceFile: networkx.algorithms.community.kernighan_lin
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - networkx.utils.heaps.BinaryHeap.__init__
    - heapq.heappop
    - <builtin>.sum
    - <builtin>.enumerate
    - costs_y.insert
    - <builtin>.len
    - networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep
    - e.get
    - networkx.utils.heaps.BinaryHeap.pop
    - <builtin>.list
    - itertools.count
    - networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep._update_costs
    - G.is_multigraph
    - <builtin>.isinstance
    - seed.shuffle
    - <builtin>.range
    - d.values
    - <builtin>.min
    - <builtin>.super
    - costs_y.get
    - networkx.algorithms.community.community_utils.is_partition
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.community.community_utils
    functionSourceFile: networkx.algorithms.community.community_utils
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.community.asyn_fluid
    functionSourceFile: networkx.algorithms.community.asyn_fluid
    functionUses: 0
    functionsReached:
    - networkx.utils.py_random_state
    - networkx.utils.decorators.py_random_state
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter.keys
    functionSourceFile: collections
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.community.kclique
    functionSourceFile: networkx.algorithms.community.kclique
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.find_cliques
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - clique
    - membership_dict
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 73
    functionName: networkx.algorithms.community.kclique._get_adjacent_cliques
    functionSourceFile: networkx.algorithms.community.kclique
    functionUses: 191
    functionsReached:
    - adjacent_cliques.add
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: clique.intersection
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: frozenset.union
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: adjacent_cliques.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.label_propagation
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 19
    functionName: networkx.algorithms.community.label_propagation.fast_label_propagation_communities
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 0
    functionsReached:
    - networkx.utils.misc.groups
    - networkx.all_neighbors
    - <builtin>.enumerate
    - <builtin>.map
    - collections.deque.append
    - <builtin>.max
    - <builtin>.len
    - collections.defaultdict.values
    - <builtin>.set
    - networkx.algorithms.community.label_propagation._fast_label_count
    - G.is_directed
    - nodes_set.add
    - nodes_set.remove
    - G.is_multigraph
    - seed.shuffle
    - collections.Counter
    - G.edges
    - collections.deque
    - collections.defaultdict
    - G.in_edges
    - collections.Counter.values
    - seed.choice
    - <builtin>.dict
    - collections.deque.popleft
    - many_to_one.items
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes_set.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bba4ac0>
    argNames:
    - G
    - comms
    - node
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 105
    functionName: networkx.algorithms.community.label_propagation._fast_label_count
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - G.in_edges
    - G.is_directed
    - G.edges
    - <builtin>.len
    - networkx.all_neighbors
    - G.is_multigraph
    - <builtin>.map
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodes_set.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cce8340>
    - <ast.Constant object at 0x7f734cce80a0>
    argNames:
    - G
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 142
    functionName: networkx.algorithms.community.label_propagation.asyn_lpa_communities
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - collections.Counter.values
    - collections.defaultdict.items
    - <builtin>.max
    - many_to_one.items
    - seed.choice
    - G.edges
    - <builtin>.list
    - <builtin>.dict
    - collections.defaultdict.values
    - networkx.utils.misc.groups
    - collections.Counter.items
    - <builtin>.enumerate
    - <builtin>.map
    - seed.shuffle
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 282
    functionName: networkx.algorithms.community.label_propagation._color_network
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 191
    functionsReached:
    - colors.items
    - networkx.algorithms.coloring.greedy_color
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - labeling
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 297
    functionName: networkx.algorithms.community.label_propagation._labeling_complete
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 191
    functionsReached:
    - collections.Counter.values
    - <builtin>.max
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - <builtin>.len
    - collections.Counter.items
    - <builtin>.all
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: coloring.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - node
    - labeling
    - G
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 326
    functionName: networkx.algorithms.community.label_propagation._update_label
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 191
    functionsReached:
    - collections.Counter.values
    - <builtin>.max
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - <builtin>.len
    - collections.Counter.items
    - high_labels.pop
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: labeling.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.coloring.greedy_color
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: colors.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - node
    - labeling
    - G
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 310
    functionName: networkx.algorithms.community.label_propagation._most_frequent_labels
    functionSourceFile: networkx.algorithms.community.label_propagation
    functionUses: 193
    functionsReached:
    - collections.Counter.values
    - <builtin>.max
    - collections.Counter
    - collections.Counter.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: high_labels.pop
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.lukes
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - min_size_of_first_part
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 20
    functionName: networkx.algorithms.community.lukes._split_n_from
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 1
    functionsReached:
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 6
    IfCount: 10
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba44640>
    - <ast.Constant object at 0x7f734ba44790>
    argNames:
    - G
    - max_size
    - node_weight
    - edge_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 29
    functionName: networkx.algorithms.community.lukes.lukes_partitioning
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 0
    functionsReached:
    - networkx.algorithms.community.lukes.lukes_partitioning._concatenate_or_merge
    - networkx.algorithms.community.lukes.lukes_partitioning._a_parent_of_leaves_only
    - networkx.classes.digraph.DiGraph.remove_nodes_from
    - networkx.algorithms.community.lukes.lukes_partitioning._pivot
    - <builtin>.sum
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.filter
    - <builtin>.all
    - networkx.set_node_attributes
    - networkx.is_directed
    - networkx.get_node_attributes
    - re.compile
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - G.in_degree
    - <builtin>.frozenset
    - networkx.algorithms.community.lukes.lukes_partitioning._weight_of_cluster
    - networkx.dfs_tree
    - networkx.utils.decorators.argmap
    - ccx.union
    - collections.namedtuple
    - networkx.is_tree
    - <builtin>.list
    - random.choice
    - functools.lru_cache
    - <builtin>.isinstance
    - bp_buffer.clear
    - networkx.descendants
    - <builtin>.range
    - bp_buffer.items
    - networkx.algorithms.community.lukes.lukes_partitioning._leaves
    - networkx.algorithms.community.lukes._split_n_from
    - networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from
    - networkx.set_edge_attributes
    - copy.deepcopy
    - networkx.algorithms.community.lukes.lukes_partitioning._value_of_partition
    - networkx.utils.decorators.not_implemented_for
    - copy.deepcopy.remove_nodes_from
    - networkx._clear_cache
    - networkx.algorithms.community.lukes.lukes_partitioning._value_of_cluster
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: random.choice
    functionSourceFile: random
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dfs_tree
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - gr
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 120
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._leaves
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 2
    functionsReached:
    - networkx.descendants
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - gr
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 126
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._a_parent_of_leaves_only
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 1
    functionsReached:
    - <builtin>.all
    - <builtin>.set
    - networkx.algorithms.community.lukes.lukes_partitioning._leaves
    - networkx.descendants
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: functools.lru_cache
    functionSourceFile: functools
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - cluster
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 133
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._value_of_cluster
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 3
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - partition
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 137
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._value_of_partition
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 2
    functionsReached:
    - <builtin>.frozenset
    - <builtin>.sum
    - networkx.algorithms.community.lukes.lukes_partitioning._value_of_cluster
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - cluster
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 141
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._weight_of_cluster
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 2
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - partition
    - node
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 144
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._pivot
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 2
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - partition_1
    - partition_2
    - x
    - i
    - ref_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 149
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._concatenate_or_merge
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 1
    functionsReached:
    - ccx.union
    - networkx.algorithms.community.lukes.lukes_partitioning._pivot
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.filter
    - networkx.algorithms.community.lukes.lukes_partitioning._value_of_partition
    - <builtin>.frozenset
    - networkx.algorithms.community.lukes.lukes_partitioning._weight_of_cluster
    - networkx.algorithms.community.lukes.lukes_partitioning._value_of_cluster
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ccx.union
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._concatenate_or_merge.<lambda1>
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.community.lukes.lukes_partitioning._concatenate_or_merge.<lambda2>
    functionSourceFile: networkx.algorithms.community.lukes
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bp_buffer.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bp_buffer.clear
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: copy.deepcopy.remove_nodes_from
    functionSourceFile: copy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.modularity_max
    functionSourceFile: networkx.algorithms.community.modularity_max
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 15
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 22
    ICount: 18
    IfCount: 15
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb6340>
    - <ast.Constant object at 0x7f734cbb6160>
    argNames:
    - G
    - weight
    - resolution
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 16
    functionName: networkx.algorithms.community.modularity_max._greedy_modularity_communities_generator
    functionSourceFile: networkx.algorithms.community.modularity_max
    functionUses: 1
    functionsReached:
    - networkx.utils.mapped_queue.MappedQueue.update
    - collections.defaultdict.items
    - networkx.utils.mapped_queue.MappedQueue.push
    - G.number_of_nodes
    - nbrdict.items
    - <builtin>.enumerate
    - networkx.utils.mapped_queue._HeapElement.__init__
    - networkx.utils.mapped_queue.MappedQueue.__init__
    - networkx.utils.mapped_queue.MappedQueue._siftup
    - dq_heap_row.remove
    - data.items
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.mapped_queue.MappedQueue._heapify
    - dq_heap_row.update
    - G.in_degree
    - <builtin>.frozenset
    - G.is_directed
    - G.out_degree
    - <builtin>.list
    - networkx.utils.mapped_queue.MappedQueue._siftdown
    - heapq.heapify
    - <builtin>.isinstance
    - G.edges
    - collections.defaultdict
    - networkx.utils.mapped_queue.MappedQueue.remove
    - G.size
    - communities.values
    - dq_heap_row.push
    - networkx.utils.mapped_queue.MappedQueue.pop
    - G.degree
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.community.modularity_max._greedy_modularity_communities_generator.<lambda1>
    functionSourceFile: networkx.algorithms.community.modularity_max
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf3d30>
    argNames:
    - self
    - data
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 153
    functionName: networkx.utils.mapped_queue.MappedQueue.__init__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 2
    functionsReached:
    - <builtin>.list
    - data.items
    - <builtin>.len
    - networkx.utils.mapped_queue.MappedQueue._heapify
    - <builtin>.enumerate
    - heapq.heapify
    - networkx.utils.mapped_queue._HeapElement.__init__
    - <builtin>.isinstance
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: communities.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 189
    functionName: networkx.utils.mapped_queue.MappedQueue.pop
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - networkx.utils.mapped_queue.MappedQueue._siftup
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0fa30>
    argNames:
    - self
    - elt
    - priority
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 174
    functionName: networkx.utils.mapped_queue.MappedQueue.push
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - <builtin>.hash
    - networkx.utils.mapped_queue.MappedQueue._siftdown
    - networkx.utils.mapped_queue._HeapElement.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - elt
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 219
    functionName: networkx.utils.mapped_queue.MappedQueue.remove
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - networkx.utils.mapped_queue.MappedQueue._siftup
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dq_heap_row.update
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dq_heap_row.push
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b3c6970>
    argNames:
    - self
    - elt
    - new
    - priority
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 207
    functionName: networkx.utils.mapped_queue.MappedQueue.update
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 2
    functionsReached:
    - <builtin>.hash
    - <builtin>.len
    - networkx.utils.mapped_queue.MappedQueue._siftup
    - networkx.utils.mapped_queue._HeapElement.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dq_heap_row.remove
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 2
    IfCount: 7
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb5f490>
    - <ast.Constant object at 0x7f734bb5fd90>
    - <ast.Constant object at 0x7f734bb5f730>
    - <ast.Constant object at 0x7f734bb5fcd0>
    argNames:
    - G
    - weight
    - resolution
    - cutoff
    - best_n
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 227
    functionName: networkx.algorithms.community.modularity_max.greedy_modularity_communities
    functionSourceFile: networkx.algorithms.community.modularity_max
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.utils.mapped_queue.MappedQueue.update
    - collections.defaultdict.items
    - networkx.utils.mapped_queue.MappedQueue.push
    - G.number_of_nodes
    - nbrdict.items
    - <builtin>.enumerate
    - networkx.utils.mapped_queue._HeapElement.__init__
    - networkx.utils.mapped_queue.MappedQueue.__init__
    - networkx.utils.mapped_queue.MappedQueue._siftup
    - dq_heap_row.remove
    - data.items
    - <builtin>.len
    - <builtin>.set
    - networkx.utils.mapped_queue.MappedQueue._heapify
    - dq_heap_row.update
    - <builtin>.next
    - G.in_degree
    - <builtin>.frozenset
    - G.is_directed
    - G.out_degree
    - <builtin>.list
    - communities.extend
    - networkx.utils.mapped_queue.MappedQueue._siftdown
    - networkx.algorithms.community.modularity_max._greedy_modularity_communities_generator
    - heapq.heapify
    - <builtin>.isinstance
    - G.edges
    - collections.defaultdict
    - networkx.utils.mapped_queue.MappedQueue.remove
    - G.size
    - communities.values
    - dq_heap_row.push
    - networkx.utils.mapped_queue.MappedQueue.pop
    - G.degree
    - <builtin>.hash
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: communities.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ceb05b0>
    - <ast.Constant object at 0x7f734cc17970>
    argNames:
    - G
    - resolution
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 360
    functionName: networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities
    functionSourceFile: networkx.algorithms.community.modularity_max
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - networkx.algorithms.community.quality.modularity
    - <builtin>.enumerate
    - <builtin>.map
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - out_degree.values
    - <builtin>.frozenset
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - merges.append
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - G.nodes
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.community.community_utils.is_partition
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: merges.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.quality
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G
    - collection
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 19
    functionName: networkx.algorithms.community.quality.NotAPartition.__init__
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 24
    functionName: networkx.algorithms.community.quality._require_partition
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 0
    functionsReached:
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - networkx.algorithms.community.community_utils.is_partition
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.quotient_graph
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: out_degree.values
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - community
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 246
    functionName: networkx.algorithms.community.quality.modularity.community_contribution
    functionSourceFile: networkx.algorithms.community.quality
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.sum
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.mapped_queue
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - priority
    - element
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 33
    functionName: networkx.utils.mapped_queue._HeapElement.__init__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 5
    functionsReached:
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.hash
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - other
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 38
    functionName: networkx.utils.mapped_queue._HeapElement.__lt__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - other
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 53
    functionName: networkx.utils.mapped_queue._HeapElement.__gt__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - other
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 68
    functionName: networkx.utils.mapped_queue._HeapElement.__eq__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 74
    functionName: networkx.utils.mapped_queue._HeapElement.__hash__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - indx
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 77
    functionName: networkx.utils.mapped_queue._HeapElement.__getitem__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 80
    functionName: networkx.utils.mapped_queue._HeapElement.__iter__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 87
    functionName: networkx.utils.mapped_queue._HeapElement.__repr__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 164
    functionName: networkx.utils.mapped_queue.MappedQueue._heapify
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 3
    functionsReached:
    - <builtin>.len
    - <builtin>.enumerate
    - heapq.heapify
    linkageType: pythonLinkage
    raised:
    - AssertionError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 171
    functionName: networkx.utils.mapped_queue.MappedQueue.__len__
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - start_pos
    - pos
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 278
    functionName: networkx.utils.mapped_queue.MappedQueue._siftdown
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - pos
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 239
    functionName: networkx.utils.mapped_queue.MappedQueue._siftup
    functionSourceFile: networkx.utils.mapped_queue
    functionUses: 5
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.centrality
    functionSourceFile: networkx.algorithms.community.centrality
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf3220>
    argNames:
    - G
    - most_valuable_edge
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 9
    functionName: networkx.algorithms.community.centrality.girvan_newman
    functionSourceFile: networkx.algorithms.community.centrality
    functionUses: 0
    functionsReached:
    - networkx.algorithms.community.centrality._without_most_central_edges
    - networkx.connected_components
    - g.number_of_edges
    - g.remove_edges_from
    - networkx.number_connected_components
    - <builtin>.max
    - <builtin>.tuple
    - networkx.algorithms.community.centrality.girvan_newman.most_valuable_edge
    - G.remove_edge
    - G.number_of_edges
    - <builtin>.len
    - G.copy
    - networkx.selfloop_edges
    - networkx.edge_betweenness_centrality
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 132
    functionName: networkx.algorithms.community.centrality.girvan_newman.most_valuable_edge
    functionSourceFile: networkx.algorithms.community.centrality
    functionUses: 2
    functionsReached:
    - <builtin>.max
    - networkx.edge_betweenness_centrality
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.edge_betweenness_centrality
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - most_valuable_edge
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 151
    functionName: networkx.algorithms.community.centrality._without_most_central_edges
    functionSourceFile: networkx.algorithms.community.centrality
    functionUses: 1
    functionsReached:
    - networkx.connected_components
    - networkx.number_connected_components
    - <builtin>.max
    - networkx.algorithms.community.centrality.girvan_newman.most_valuable_edge
    - <builtin>.tuple
    - G.remove_edge
    - <builtin>.len
    - networkx.edge_betweenness_centrality
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.leiden
    functionSourceFile: networkx.algorithms.community.leiden
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf760>
    - <ast.Constant object at 0x7f734a4cfc70>
    - <ast.Constant object at 0x7f734a4cf370>
    - <ast.Constant object at 0x7f734a4cfe50>
    argNames:
    - G
    - weight
    - resolution
    - max_level
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 21
    functionName: networkx.algorithms.community.leiden.leiden_communities
    functionSourceFile: networkx.algorithms.community.leiden
    functionUses: 0
    functionsReached:
    - collections.deque.pop
    - networkx.algorithms.community.leiden.leiden_partitions
    - collections.deque
    - itertools.islice
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb324f0>
    - <ast.Constant object at 0x7f734cb32310>
    - <ast.Constant object at 0x7f734cb329d0>
    argNames:
    - G
    - weight
    - resolution
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 113
    functionName: networkx.algorithms.community.leiden.leiden_partitions
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.community.divisive
    functionSourceFile: networkx.algorithms.community.divisive
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - number_of_sets
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 12
    functionName: networkx.algorithms.community.divisive.edge_betweenness_partition
    functionSourceFile: networkx.algorithms.community.divisive
    functionUses: 0
    functionsReached:
    - networkx.connected_components
    - <builtin>.max
    - <builtin>.list
    - <builtin>.len
    - G.copy
    - <builtin>.set
    - H.remove_edge
    - networkx.edge_betweenness_centrality
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 7
    IfCount: 7
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - number_of_sets
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 108
    functionName: networkx.algorithms.community.divisive.edge_current_flow_betweenness_partition
    functionSourceFile: networkx.algorithms.community.divisive
    functionUses: 0
    functionsReached:
    - networkx.connected_components
    - <builtin>.zip
    - <builtin>.max
    - cc.difference_update
    - newranks.items
    - <builtin>.min
    - <builtin>.list
    - Hcc.subgraph
    - <builtin>.len
    - ranking.update
    - Hcc.remove_nodes_from
    - G.copy
    - <builtin>.set
    - Hcc.remove_edge
    - H.subgraph
    - partition.append
    - Hcc_subgraphs.append
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ranking.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Hcc.remove_edge
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Hcc.subgraph
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: newranks.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: partition.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Hcc_subgraphs.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Hcc.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cc.difference_update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity
    functionSourceFile: networkx.algorithms.connectivity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.kcomponents
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.node_connectivity
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.all_node_cuts
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - cuts
    - k
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 181
    functionName: networkx.algorithms.connectivity.kcomponents._generate_partition
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 191
    functionsReached:
    - networkx.connected_components
    - components.append
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - set.union
    - <builtin>.map
    - keylist.append
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - G.subgraph
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - <builtin>.len
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - G.order
    - <builtin>.iter
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - G.degree
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B.subgraph
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - k_comps
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 196
    functionName: networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 191
    functionsReached:
    - networkx.connected_components
    - attr.copy
    - keydict.get
    - newdict.update
    - set.union
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - sets
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 159
    functionName: networkx.algorithms.connectivity.kcomponents._consolidate
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 193
    functionsReached:
    - networkx.connected_components
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - set.union
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - node
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 182
    functionName: networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 192
    functionsReached:
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: components.append
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - kcomps
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 214
    functionName: networkx.algorithms.connectivity.kcomponents.build_k_number_dict
    functionSourceFile: networkx.algorithms.connectivity.kcomponents
    functionUses: 0
    functionsReached:
    - kcomps.items
    - operator.itemgetter
    - <builtin>.sorted
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kcomps.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.flow
    functionSourceFile: networkx.algorithms.flow
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.maxflow
    functionSourceFile: networkx.algorithms.flow.maxflow
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67ffa0>
    - <ast.Constant object at 0x7f734a67fe80>
    argNames:
    - flowG
    - _s
    - _t
    - capacity
    - flow_func
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 21
    functionName: networkx.algorithms.flow.maxflow.maximum_flow
    functionSourceFile: networkx.algorithms.flow.maxflow
    functionUses: 0
    functionsReached:
    - itertools.islice
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - datadict.update
    - <builtin>.max
    - level.inactive.add
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    - <builtin>.float
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - attr.copy
    - keydict.get
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - <builtin>.set
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - heights.values
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - curr_edge.move_to_next
    - <builtin>.iter
    - <builtin>.callable
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx.algorithms.flow.utils.build_flow_dict
    - networkx._clear_cache
    - level.active.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.algorithms.flow.utils.detect_unboundedness
    - networkx.algorithms.flow.utils.Level.__init__
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - attr.get
    - networkx.algorithms.flow.preflowpush.preflow_push
    - networkx.classes.graph.Graph.has_edge
    - heights.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    - <builtin>.range
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    - networkx.classes.graph.Graph.__iter__
    - level.inactive.remove
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - <builtin>.list
    - itertools.islice.inactive.clear
    - collections.deque
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - curr_edge.get
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf0d0>
    - <ast.Constant object at 0x7f734a4cf370>
    - <ast.Constant object at 0x7f734a4cfc70>
    - <ast.Constant object at 0x7f734a4cfe50>
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - global_relabel_freq
    - value_only
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 292
    functionName: networkx.algorithms.flow.preflowpush.preflow_push
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 4
    functionsReached:
    - level.inactive.remove
    - level.active.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.algorithms.flow.utils.detect_unboundedness
    - itertools.islice
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - seen.add
    - networkx.algorithms.flow.utils.Level.__init__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - level.inactive.add
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - attr.get
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - heights.values
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - heights.items
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - itertools.islice.inactive.clear
    - curr_edge.move_to_next
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - curr_edge.get
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - R
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 186
    functionName: networkx.algorithms.flow.utils.build_flow_dict
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7edf0>
    - <ast.Constant object at 0x7f734bb7ed90>
    argNames:
    - flowG
    - _s
    - _t
    - capacity
    - flow_func
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 172
    functionName: networkx.algorithms.flow.maxflow.maximum_flow_value
    functionSourceFile: networkx.algorithms.flow.maxflow
    functionUses: 0
    functionsReached:
    - level.inactive.remove
    - level.active.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.algorithms.flow.utils.detect_unboundedness
    - itertools.islice
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - seen.add
    - networkx.algorithms.flow.utils.Level.__init__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - level.inactive.add
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - attr.get
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.flow.preflowpush.preflow_push
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - heights.values
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - heights.items
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - itertools.islice.inactive.clear
    - <builtin>.callable
    - curr_edge.move_to_next
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - curr_edge.get
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc904f0>
    - <ast.Constant object at 0x7f734bc906d0>
    argNames:
    - flowG
    - _s
    - _t
    - capacity
    - flow_func
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 312
    functionName: networkx.algorithms.flow.maxflow.minimum_cut
    functionSourceFile: networkx.algorithms.flow.maxflow
    functionUses: 0
    functionsReached:
    - path.reverse
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - itertools.islice
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - datadict.update
    - <builtin>.max
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - level.inactive.add
    - networkx.shortest_path_length
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    - <builtin>.float
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - R.remove_edges_from
    - R.add_edges_from
    - attr.copy
    - keydict.get
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - R.edges
    - <builtin>.set
    - q.append
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - heights.values
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - curr_edge.move_to_next
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - <builtin>.callable
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx._clear_cache
    - level.active.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.algorithms.flow.utils.detect_unboundedness
    - networkx.algorithms.flow.utils.Level.__init__
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - attr.get
    - networkx.algorithms.flow.preflowpush.preflow_push
    - networkx.classes.graph.Graph.has_edge
    - heights.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    - <builtin>.range
    - path.append
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    - networkx.classes.graph.Graph.__iter__
    - level.inactive.remove
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - kwargs.get
    - <builtin>.list
    - itertools.islice.inactive.clear
    - collections.deque
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - curr_edge.get
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55700>
    - <ast.Constant object at 0x7f734bb556a0>
    - <ast.Constant object at 0x7f734bb55130>
    - <ast.Constant object at 0x7f734bb558b0>
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - value_only
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 121
    functionName: networkx.algorithms.flow.edmondskarp.edmonds_karp
    functionSourceFile: networkx.algorithms.flow.edmondskarp
    functionUses: 194
    functionsReached:
    - attr.copy
    - keydict.get
    - <builtin>.sum
    - newdict.update
    - path.reverse
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - <builtin>.len
    - attr.get
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - q.append
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.edges
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa81f0>
    - <ast.Constant object at 0x7f734aaa89d0>
    argNames:
    - flowG
    - _s
    - _t
    - capacity
    - flow_func
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 475
    functionName: networkx.algorithms.flow.maxflow.minimum_cut_value
    functionSourceFile: networkx.algorithms.flow.maxflow
    functionUses: 0
    functionsReached:
    - itertools.islice
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - datadict.update
    - <builtin>.max
    - level.inactive.add
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    - <builtin>.float
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - attr.copy
    - keydict.get
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - <builtin>.set
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - heights.values
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - curr_edge.move_to_next
    - <builtin>.iter
    - <builtin>.callable
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx._clear_cache
    - level.active.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.algorithms.flow.utils.detect_unboundedness
    - networkx.algorithms.flow.utils.Level.__init__
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - attr.get
    - networkx.algorithms.flow.preflowpush.preflow_push
    - networkx.classes.graph.Graph.has_edge
    - heights.items
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    - <builtin>.range
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    - networkx.classes.graph.Graph.__iter__
    - level.inactive.remove
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - kwargs.get
    - <builtin>.list
    - itertools.islice.inactive.clear
    - collections.deque
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - curr_edge.get
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.dinitz_alg
    functionSourceFile: networkx.algorithms.flow.dinitz_alg
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb321f0>
    - <ast.Constant object at 0x7f734ceff2b0>
    - <ast.Constant object at 0x7f734ceff700>
    - <ast.Constant object at 0x7f734cc26880>
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - value_only
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 15
    functionName: networkx.algorithms.flow.dinitz_alg.dinitz
    functionSourceFile: networkx.algorithms.flow.dinitz_alg
    functionUses: 0
    functionsReached:
    - networkx.algorithms.flow.dinitz_alg.dinitz_impl
    - <builtin>.zip
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.utils.misc.pairwise
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - itertools.pairwise
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.reversed
    - <builtin>.len
    - attr.get
    - path.pop
    - networkx.classes.graph.Graph.has_edge
    - <builtin>.next
    - itertools.chain
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.algorithms.flow.dinitz_alg.dinitz_impl.breath_first_search
    - collections.deque.popleft
    - networkx.algorithms.flow.dinitz_alg.dinitz_impl.depth_first_search
    - networkx.classes.graph.Graph.__iter__
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 0
    IfCount: 7
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 143
    functionName: networkx.algorithms.flow.dinitz_alg.dinitz_impl
    functionSourceFile: networkx.algorithms.flow.dinitz_alg
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.utils.misc.pairwise
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.reversed
    - <builtin>.len
    - attr.get
    - path.pop
    - networkx.classes.graph.Graph.has_edge
    - <builtin>.next
    - itertools.chain
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.algorithms.flow.dinitz_alg.dinitz_impl.breath_first_search
    - collections.deque.popleft
    - networkx.algorithms.flow.dinitz_alg.dinitz_impl.depth_first_search
    - networkx.classes.graph.Graph.__iter__
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - capacity
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 81
    functionName: networkx.algorithms.flow.utils.build_residual_network
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 214
    functionsReached:
    - attr.copy
    - keydict.get
    - <builtin>.sum
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - attr.get
    - networkx.classes.graph.Graph.has_edge
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 171
    functionName: networkx.algorithms.flow.dinitz_alg.dinitz_impl.breath_first_search
    functionSourceFile: networkx.algorithms.flow.dinitz_alg
    functionUses: 2
    functionsReached:
    - collections.deque.append
    - collections.deque.popleft
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 6
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - parents
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 191
    functionName: networkx.algorithms.flow.dinitz_alg.dinitz_impl.depth_first_search
    functionSourceFile: networkx.algorithms.flow.dinitz_alg
    functionUses: 2
    functionsReached:
    - itertools.pairwise
    - <builtin>.reversed
    - path.append
    - <builtin>.zip
    - <builtin>.min
    - <builtin>.next
    - <builtin>.len
    - itertools.tee
    - path.pop
    - networkx.utils.misc.pairwise
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.utils
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - edges
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 26
    functionName: networkx.algorithms.flow.utils.CurrentEdge.__init__
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 8
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 41
    functionName: networkx.algorithms.flow.utils.CurrentEdge._rewind
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 10
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 31
    functionName: networkx.algorithms.flow.utils.CurrentEdge.get
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 34
    functionName: networkx.algorithms.flow.utils.CurrentEdge.move_to_next
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - other
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 45
    functionName: networkx.algorithms.flow.utils.CurrentEdge.__eq__
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 0
    functionsReached:
    - <builtin>.getattr
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 56
    functionName: networkx.algorithms.flow.utils.Level.__init__
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 6
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - n
    - m
    - freq
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 66
    functionName: networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 6
    functionsReached:
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - work
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 70
    functionName: networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 73
    functionName: networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 76
    functionName: networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - R
    - s
    - t
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 168
    functionName: networkx.algorithms.flow.utils.detect_unboundedness
    functionSourceFile: networkx.algorithms.flow.utils
    functionUses: 6
    functionsReached:
    - collections.deque.append
    - collections.deque.popleft
    - seen.add
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.preflowpush
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 16
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 23
    ICount: 9
    IfCount: 16
    argCount: 7
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - global_relabel_freq
    - value_only
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 22
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 5
    functionsReached:
    - level.inactive.remove
    - level.active.add
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.algorithms.flow.utils.detect_unboundedness
    - itertools.islice
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - seen.add
    - networkx.algorithms.flow.utils.Level.__init__
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.is_reached
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - level.inactive.add
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - attr.get
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.clear_work
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - heights.values
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.list
    - curr_edge.move_to_next
    - itertools.islice.inactive.clear
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - heights.items
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - curr_edge.get
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - src
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 53
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 7
    functionsReached:
    - collections.deque.append
    - collections.deque.popleft
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - u
    - v
    - flow
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 90
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: level.active.add
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: level.inactive.add
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 114
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 7
    functionsReached:
    - level.inactive.remove
    - level.active.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: level.inactive.remove
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - u
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 122
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 7
    functionsReached:
    - <builtin>.len
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - is_phase1
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 134
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 6
    functionsReached:
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.push
    - level.inactive.remove
    - level.active.add
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.activate
    - networkx.algorithms.flow.utils.GlobalRelabelThreshold.add_work
    - <builtin>.min
    - curr_edge.move_to_next
    - curr_edge.get
    - <builtin>.len
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: curr_edge.get
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: curr_edge.move_to_next
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - height
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 175
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 6
    functionsReached:
    - itertools.islice.inactive.clear
    - itertools.islice
    - itertools.islice.active.clear
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.islice.active.clear
    functionSourceFile: itertools
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.islice.inactive.clear
    functionSourceFile: itertools
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - from_sink
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 188
    functionName: networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel
    functionSourceFile: networkx.algorithms.flow.preflowpush
    functionUses: 6
    functionsReached:
    - collections.deque.append
    - heights.values
    - <builtin>.max
    - heights.items
    - collections.deque.popleft
    - networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: heights.values
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: heights.items
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.boykovkolmogorov
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7343aea790>
    - <ast.Constant object at 0x7f7343aea760>
    - <ast.Constant object at 0x7f7343aea730>
    - <ast.Constant object at 0x7f7343aea700>
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - value_only
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 15
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._is_closer
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - path.reverse
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.grow
    - operator.itemgetter
    - attr.get
    - these_orphans.append
    - collections.deque.extend
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.adopt
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._has_valid_root
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.augment
    - collections.deque
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 164
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._is_closer
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - path.reverse
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - collections.deque.append
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.grow
    - operator.itemgetter
    - attr.get
    - these_orphans.append
    - collections.deque.extend
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.adopt
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._has_valid_root
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.augment
    - collections.deque
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 194
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.grow
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 2
    functionsReached:
    - collections.deque.append
    - collections.deque.popleft
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._is_closer
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 338
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._is_closer
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 8
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 229
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.augment
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - path.append
    - <builtin>.min
    - path.reverse
    - <builtin>.iter
    - these_orphans.append
    - collections.deque.extend
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: these_orphans.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 277
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.adopt
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - path.append
    - networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._has_valid_root
    - <builtin>.len
    - operator.itemgetter
    - collections.deque.popleft
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - tree
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 318
    functionName: networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._has_valid_root
    functionSourceFile: networkx.algorithms.flow.boykovkolmogorov
    functionUses: 3
    functionsReached:
    - <builtin>.len
    - path.append
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.shortestaugmentingpath
    functionSourceFile: networkx.algorithms.flow.shortestaugmentingpath
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 14
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 21
    ICount: 5
    IfCount: 14
    argCount: 7
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - two_phase
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 15
    functionName: networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl
    functionSourceFile: networkx.algorithms.flow.shortestaugmentingpath
    functionUses: 1
    functionsReached:
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - <builtin>.sum
    - path.reverse
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - newdict.update
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - attr.get
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - q.append
    - path.pop
    - networkx.classes.graph.Graph.has_edge
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - curr_edge.move_to_next
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - collections.deque
    - networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.relabel
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.augment
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - curr_edge.get
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 70
    functionName: networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.augment
    functionSourceFile: networkx.algorithms.flow.shortestaugmentingpath
    functionUses: 2
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - u
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 91
    functionName: networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.relabel
    functionSourceFile: networkx.algorithms.flow.shortestaugmentingpath
    functionUses: 2
    functionsReached:
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - R
    - s
    - t
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 11
    functionName: networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    functionSourceFile: networkx.algorithms.flow.edmondskarp
    functionUses: 198
    functionsReached:
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - path.append
    - <builtin>.min
    - path.reverse
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.len
    - <builtin>.next
    - q.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734b783280>
    - <ast.Constant object at 0x7f734b783760>
    - <ast.Constant object at 0x7f734b783d00>
    - <ast.Constant object at 0x7f734b7836a0>
    - <ast.Constant object at 0x7f734b783e50>
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - value_only
    - two_phase
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 167
    functionName: networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path
    functionSourceFile: networkx.algorithms.flow.shortestaugmentingpath
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - <builtin>.sum
    - path.reverse
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - newdict.update
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - attr.get
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - q.append
    - path.pop
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.digraph.DiGraph.degree
    - networkx.algorithms.flow.utils.CurrentEdge._rewind
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.flow.utils.CurrentEdge.__init__
    - networkx.classes.multigraph.MultiGraph.has_edge
    - curr_edge.move_to_next
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.list
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - collections.deque
    - networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.relabel
    - networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.augment
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - curr_edge.get
    - networkx.classes.digraph.DiGraph.is_directed
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.edmondskarp
    functionSourceFile: networkx.algorithms.flow.edmondskarp
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - path
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 19
    functionName: networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    functionSourceFile: networkx.algorithms.flow.edmondskarp
    functionUses: 199
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 3
    IfCount: 7
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 40
    functionName: networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    functionSourceFile: networkx.algorithms.flow.edmondskarp
    functionUses: 199
    functionsReached:
    - <builtin>.len
    - q.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: q.append
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 6
    argDefaultValues: []
    argNames:
    - G
    - s
    - t
    - capacity
    - residual
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 94
    functionName: networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    functionSourceFile: networkx.algorithms.flow.edmondskarp
    functionUses: 195
    functionsReached:
    - attr.copy
    - path.reverse
    - <builtin>.sum
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - keydict.get
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - attr.get
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - q.append
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.mincost
    functionSourceFile: networkx.algorithms.flow.mincost
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c8de130>
    - <ast.Constant object at 0x7f734c8de850>
    - <ast.Constant object at 0x7f734c8de7c0>
    argNames:
    - G
    - demand
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.flow.mincost.min_cost_flow_cost
    functionSourceFile: networkx.algorithms.flow.mincost
    functionUses: 0
    functionsReached:
    - networkx.network_simplex
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.network_simplex
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb32a00>
    - <ast.Constant object at 0x7f734cb32280>
    - <ast.Constant object at 0x7f734cb320d0>
    argNames:
    - G
    - demand
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 105
    functionName: networkx.algorithms.flow.mincost.min_cost_flow
    functionSourceFile: networkx.algorithms.flow.mincost
    functionUses: 1
    functionsReached:
    - networkx.network_simplex
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6ebb0>
    argNames:
    - G
    - flowDict
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 196
    functionName: networkx.algorithms.flow.mincost.cost_of_flow
    functionSourceFile: networkx.algorithms.flow.mincost
    functionUses: 0
    functionsReached:
    - <builtin>.sum
    - G.edges
    - d.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd6cb80>
    - <ast.Constant object at 0x7f734cd6c8b0>
    argNames:
    - G
    - s
    - t
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 256
    functionName: networkx.algorithms.flow.mincost.max_flow_min_cost
    functionSourceFile: networkx.algorithms.flow.mincost
    functionUses: 0
    functionsReached:
    - networkx.algorithms.flow.mincost.min_cost_flow
    - attr_dict.update
    - networkx.network_simplex
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.maximum_flow_value
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.maximum_flow_value
    functionSourceFile: ''
    functionUses: 204
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.networksimplex
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7348158310>
    - <ast.Constant object at 0x7f73481582e0>
    - <ast.Constant object at 0x7f73481582b0>
    argNames:
    - self
    - G
    - multigraph
    - demand
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 15
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.__init__
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.list
    - <builtin>.enumerate
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - n
    - faux_inf
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 64
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.initialize_spanning_tree
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.list
    - <builtin>.len
    - <builtin>.abs
    - itertools.repeat
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - p
    - q
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 86
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_apex
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - p
    - w
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 108
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_path
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 2
    functionsReached:
    - Wn.append
    - We.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: We.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Wn.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - i
    - p
    - q
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 120
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_cycle
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - We.reverse
    - We.append
    - Wn.append
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_path
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_apex
    - Wn.reverse
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Wn.reverse
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: We.reverse
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - Wn
    - We
    - f
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 139
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.augment_flow
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - p
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 149
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_subtree
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - s
    - t
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 159
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.remove_edge
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - q
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 183
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.make_root
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - ancestors.append
    - ancestors.reverse
    - itertools.islice
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ancestors.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ancestors.reverse
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - i
    - p
    - q
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 221
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.add_edge
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - i
    - p
    - q
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 245
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.update_potentials
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_subtree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - i
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 257
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.reduced_cost
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 266
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_entering_edges
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - math.sqrt
    - <builtin>.range
    - <builtin>.int
    - <builtin>.min
    - math.ceil
    - itertools.chain
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.reduced_cost
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - i
    - p
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 308
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.residual_capacity
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - Wn
    - We
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 318
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_leaving_edge
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached:
    - <builtin>.reversed
    - <builtin>.zip
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_leaving_edge.<lambda1>
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 0
    functionsReached:
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.residual_capacity
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 19
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 11
    EdgeCount: 28
    ICount: 18
    IfCount: 19
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfed00>
    - <ast.Constant object at 0x7f734cbfecd0>
    - <ast.Constant object at 0x7f734cbfe880>
    argNames:
    - G
    - demand
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 332
    functionName: networkx.algorithms.flow.networksimplex.network_simplex
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 0
    functionsReached:
    - We.reverse
    - <builtin>.zip
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.residual_capacity
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_entering_edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_cycle
    - <builtin>.sum
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.augment_flow
    - nbrs.items
    - ancestors.append
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.make_root
    - <builtin>.enumerate
    - itertools.islice
    - itertools.repeat
    - <builtin>.abs
    - networkx.algorithms.flow.networksimplex.network_simplex.add_entry
    - <builtin>.any
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_subtree
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - math.sqrt
    - <builtin>.int
    - <builtin>.reversed
    - <builtin>.max
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_path
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.add_edge
    - <builtin>.len
    - Wn.reverse
    - DEAF.edge_targets.append
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.initialize_spanning_tree
    - itertools.chain
    - DEAF.edge_sources.append
    - <builtin>.hasattr
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.remove_edge
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_apex
    - <builtin>.list
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.update_potentials
    - networkx.selfloop_edges
    - <builtin>.float
    - DEAF.edge_weights.extend
    - math.ceil
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_leaving_edge
    - DEAF.edge_capacities.extend
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.__init__
    - <builtin>.range
    - We.append
    - Wn.append
    - We.index
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - ancestors.reverse
    - networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.reduced_cost
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: DEAF.edge_sources.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: DEAF.edge_targets.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: DEAF.edge_weights.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: DEAF.edge_capacities.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: We.index
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - e
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 621
    functionName: networkx.algorithms.flow.networksimplex.network_simplex.add_entry
    functionSourceFile: networkx.algorithms.flow.networksimplex
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.gomory_hu
    functionSourceFile: networkx.algorithms.flow.gomory_hu
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc17970>
    - <ast.Constant object at 0x7f734cf82fd0>
    argNames:
    - G
    - capacity
    - flow_func
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 18
    functionName: networkx.algorithms.flow.gomory_hu.gomory_hu_tree
    functionSourceFile: networkx.algorithms.flow.gomory_hu
    functionUses: 0
    functionsReached:
    - networkx.minimum_cut
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - attr.get
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - labels.get
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - tree.items
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.minimum_cut
    functionSourceFile: ''
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: labels.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tree.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.flow.capacityscaling
    functionSourceFile: networkx.algorithms.flow.capacityscaling
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - R
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 15
    functionName: networkx.algorithms.flow.capacityscaling._detect_unboundedness
    functionSourceFile: networkx.algorithms.flow.capacityscaling
    functionUses: 2
    functionsReached:
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.negative_edge_cycle
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx._clear_cache
    - <builtin>.min
    - keydict.get
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - attr.copy
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.float
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - e.items
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.negative_edge_cycle
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - demand
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 42
    functionName: networkx.algorithms.flow.capacityscaling._build_residual_network
    functionSourceFile: networkx.algorithms.flow.capacityscaling
    functionUses: 1
    functionsReached:
    - networkx.negative_edge_cycle
    - attr.copy
    - keydict.get
    - <builtin>.sum
    - newdict.update
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - e.get
    - <builtin>.iter
    - G.is_multigraph
    - networkx.algorithms.flow.capacityscaling._detect_unboundedness
    - networkx.selfloop_edges
    - <builtin>.float
    - G.edges
    - e.items
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.min
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - R
    - capacity
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 108
    functionName: networkx.algorithms.flow.capacityscaling._build_flow_dict
    functionSourceFile: networkx.algorithms.flow.capacityscaling
    functionUses: 1
    functionsReached:
    - e.get
    - es.values
    - G.is_multigraph
    - es.items
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: es.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: es.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 16
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 23
    ICount: 7
    IfCount: 16
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65eb80>
    - <ast.Constant object at 0x7f734a65e610>
    - <ast.Constant object at 0x7f734a65e760>
    - <ast.Name object at 0x7f734a65e2b0>
    argNames:
    - G
    - demand
    - capacity
    - weight
    - heap
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 155
    functionName: networkx.algorithms.flow.capacityscaling.capacity_scaling
    functionSourceFile: networkx.algorithms.flow.capacityscaling
    functionUses: 0
    functionsReached:
    - networkx.negative_edge_cycle
    - networkx.utils.heaps.BinaryHeap.__init__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.algorithms.flow.capacityscaling._build_flow_dict
    - <builtin>.abs
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - es.values
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.flow.capacityscaling._build_residual_network
    - itertools.chain
    - <builtin>.hasattr
    - e.get
    - d.items
    - h.pop
    - itertools.count
    - <builtin>.iter
    - es.items
    - G.is_multigraph
    - networkx.algorithms.flow.capacityscaling._detect_unboundedness
    - <builtin>.float
    - networkx.selfloop_edges
    - <builtin>.isinstance
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - e.items
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - math.log
    - <builtin>.min
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.edge_augmentation
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - collections.namedtuple
    - networkx.is_k_edge_connected
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.has_bridges
    functionSourceFile: ''
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.edge_connectivity
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_k_edge_connected
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - H
    - only1
    - only2
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 342
    functionName: networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - <builtin>.set
    - neighbs.intersection
    - only1_adj.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: only1_adj.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: neighbs.intersection
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a35b0>
    - <ast.Constant object at 0x7f734d3a3280>
    argNames:
    - avail
    - weight
    - G
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 504
    functionName: networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 197
    functionsReached:
    - avail.keys
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - <builtin>.list
    - G.has_edge
    - <builtin>.len
    - <builtin>.isinstance
    - avail.values
    - itertools.compress
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.k_edge_subgraphs
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.edges
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sub_avail.keys
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.k_edge_augmentation
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 499
    functionName: networkx.algorithms.connectivity.edge_augmentation._ordered
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: avail.keys
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: avail.values
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - d
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 513
    functionName: networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.compress
    functionSourceFile: itertools
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - mapping
    - avail_uv
    - avail_w
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 533
    functionName: networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 195
    functionsReached:
    - collections.defaultdict
    - collections.defaultdict.items
    - collections.namedtuple
    - <builtin>.zip
    - <builtin>.min
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 7
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - grouped_nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1045
    functionName: networkx.algorithms.connectivity.edge_augmentation.collapse
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 197
    functionsReached:
    - remaining.issuperset
    - <builtin>.range
    - C.add_nodes_from
    - G.nodes
    - G.__class__
    - mapping.update
    - C.add_edges_from
    - networkx.set_node_attributes
    - <builtin>.set
    - <builtin>.enumerate
    - remaining.difference_update
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.add_edges_from
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: meta_mst.edges
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.copy
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dfs_preorder_nodes
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation.<lambda1>
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 0
    functionsReached:
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.has_edge
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.add_edge
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.degree
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.reverse
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: meta_to_wuv.keys
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.tree_all_pairs_lowest_common_ancestor
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - D
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1020
    functionName: networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 193
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - G.graph.update
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.minimum_spanning_arborescence
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - collections.abc.Mapping.items
    - datadict.copy
    - networkx.freeze
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.edges
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bridge_connectors.add
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.minimum_spanning_arborescence
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: remaining.issuperset
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: remaining.difference_update
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.add_nodes_from
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - rng
    - input
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1154
    functionName: networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    functionSourceFile: networkx.algorithms.connectivity.edge_augmentation
    functionUses: 192
    functionsReached:
    - rng.shuffle
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rng.shuffle
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: aug_edges.append
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.degree
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: aug_edges.remove
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.edge_kcomponents
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 5
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - EdgeComponentAuxGraph
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 316
    functionName: networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 192
    functionsReached:
    - networkx.minimum_cut
    - G.__class__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.get
    - networkx.utils.decorators.argmap.__init__
    - H.add_edges_from
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - H.nodes
    - H.is_directed
    - avail.intersection
    - <builtin>.iter
    - H.add_nodes_from
    - <builtin>.isinstance
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.nodes
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.utils.decorators.not_implemented_for
    - H.number_of_nodes
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: aux_graph.k_edge_components
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 189
    functionName: networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 191
    functionsReached:
    - G.subgraph
    - networkx.minimum_edge_cut
    - C.nodes
    - G.nodes
    - G.number_of_nodes
    - R0.add
    - R0.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - G1.subgraph
    - G1.remove_edges_from
    - G1.number_of_nodes
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 6
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 508
    functionName: networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 192
    functionsReached:
    - G.subgraph
    - networkx.minimum_edge_cut
    - G.nodes
    - G.number_of_nodes
    - R0.add
    - R0.pop
    - <builtin>.len
    - G1.subgraph
    - G1.remove_edges_from
    - G1.number_of_nodes
    - functools.partial
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct.<lambda1>
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - H
    - A
    - source
    - avail
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 339
    functionName: networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 193
    functionsReached:
    - H.is_directed
    - networkx.utils.arbitrary_element
    - datadict.update
    - networkx.minimum_cut
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - avail.intersection
    - networkx._clear_cache
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.get
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.isinstance
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.is_directed
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: avail.intersection
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.number_of_nodes
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 383
    functionName: networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_components
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 0
    functionsReached:
    - networkx.connected_components
    - keydict.get
    - attr.copy
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - A.nodes
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.get_edge_attributes
    - aux_weights.items
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.nodes
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: aux_weights.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 416
    functionName: networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 0
    functionsReached:
    - networkx.connected_components
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - H.subgraph
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - A.nodes
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.iter
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.get_edge_attributes
    - aux_weights.items
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 6
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cae7f10>
    argNames:
    - G
    - k
    - nbunch
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 461
    functionName: networkx.algorithms.connectivity.edge_kcomponents._low_degree_nodes
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 1
    functionsReached:
    - G.is_directed
    - G.out_degree
    - <builtin>.set
    - G.degree
    - G.in_degree
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 482
    functionName: networkx.algorithms.connectivity.edge_kcomponents._high_degree_components
    functionSourceFile: networkx.algorithms.connectivity.edge_kcomponents
    functionUses: 0
    functionsReached:
    - G.is_directed
    - itertools.chain.from_iterable
    - networkx.connected_components
    - nbunch.difference_update
    - networkx.algorithms.connectivity.edge_kcomponents._low_degree_nodes
    - G.out_degree
    - G.copy
    - <builtin>.set
    - <builtin>.map
    - G.degree
    - networkx.strongly_connected_components
    - G.in_degree
    - seen.add
    - H.remove_nodes_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbunch.difference_update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R0.pop
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.minimum_edge_cut
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.subgraph
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R0.add
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.stoerwagner
    functionSourceFile: networkx.algorithms.connectivity.stoerwagner
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 8
    IfCount: 7
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb6d0>
    - <ast.Name object at 0x7f734ccfb250>
    argNames:
    - G
    - weight
    - heap
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 17
    functionName: networkx.algorithms.connectivity.stoerwagner.stoer_wagner
    functionSourceFile: networkx.algorithms.connectivity.stoerwagner
    functionUses: 0
    functionsReached:
    - networkx.utils.heaps.BinaryHeap.__init__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.classes.digraph.DiGraph.add_node
    - nbrs.items
    - keydict.get
    - itertools.islice
    - networkx.single_source_shortest_path_length
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - h.get
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - A.add
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - <builtin>.next
    - networkx.classes.graph.Graph.remove_node
    - attr_dict.update
    - <builtin>.hasattr
    - h.insert
    - contractions.append
    - h.pop
    - <builtin>.list
    - itertools.count
    - <builtin>.iter
    - <builtin>.float
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.super
    - h.min
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.insert
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.min
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: contractions.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.cuts
    functionSourceFile: networkx.algorithms.connectivity.cuts
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f73435ec190>
    - <ast.Constant object at 0x7f73435ec160>
    - <ast.Constant object at 0x7f73435ec130>
    argNames:
    - G
    - s
    - t
    - flow_func
    - auxiliary
    - residual
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 30
    functionName: networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    functionSourceFile: networkx.algorithms.connectivity.cuts
    functionUses: 193
    functionsReached:
    - networkx.minimum_cut
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - cutset.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.set
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 5
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 64
    functionName: networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    functionSourceFile: networkx.algorithms.connectivity.utils
    functionUses: 205
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - nbrs.items
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - newdict.update
    - <builtin>.iter
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx._clear_cache
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cutset.update
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc98580>
    - <ast.Constant object at 0x7f734cc98460>
    - <ast.Constant object at 0x7f734cc98bb0>
    argNames:
    - G
    - s
    - t
    - flow_func
    - auxiliary
    - residual
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 167
    functionName: networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    functionSourceFile: networkx.algorithms.connectivity.cuts
    functionUses: 191
    functionsReached:
    - networkx.minimum_cut
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - newdict.update
    - <builtin>.enumerate
    - cutset.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - edges.append
    - <builtin>.len
    - <builtin>.set
    - G.is_directed
    - attr_dict.update
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.get
    - G.edges
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - G.has_edge
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 7
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 11
    functionName: networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    functionSourceFile: networkx.algorithms.connectivity.utils
    functionUses: 198
    functionsReached:
    - G.is_directed
    - attr_dict.update
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - edges.append
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - <builtin>.enumerate
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - G.edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.graph.get
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 421
    functionName: networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    functionSourceFile: networkx.algorithms.connectivity.cuts
    functionUses: 191
    functionsReached:
    - itertools.chain.from_iterable
    - G.successors
    - G.predecessors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.dominating_set
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: D.pop
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfecd0>
    - <ast.Constant object at 0x7f734cbfea60>
    - <ast.Constant object at 0x7f734cbfea30>
    - <ast.Constant object at 0x7f734cbfe4f0>
    argNames:
    - G
    - s
    - t
    - flow_func
    - auxiliary
    - residual
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 36
    functionName: networkx.algorithms.connectivity.connectivity.local_node_connectivity
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 193
    functionsReached:
    - G.is_directed
    - attr_dict.update
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - edges.append
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - H.graph.get
    - G.edges
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 319
    functionName: networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    functionSourceFile: networkx.algorithms.connectivity.connectivity
    functionUses: 191
    functionsReached:
    - itertools.chain.from_iterable
    - G.successors
    - G.predecessors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.utils
    functionSourceFile: networkx.algorithms.connectivity.utils
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.disjoint_paths
    functionSourceFile: networkx.algorithms.connectivity.disjoint_paths
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 6
    IfCount: 11
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4280>
    - <ast.Constant object at 0x7f734b5c4910>
    - <ast.Constant object at 0x7f734b5c46d0>
    - <ast.Constant object at 0x7f734b5c46a0>
    argNames:
    - G
    - s
    - t
    - flow_func
    - cutoff
    - auxiliary
    - residual
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 27
    functionName: networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths
    functionSourceFile: networkx.algorithms.connectivity.disjoint_paths
    functionUses: 1
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - nbrs.items
    - path.reverse
    - newdict.update
    - <builtin>.sum
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - R.edges
    - <builtin>.len
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - attr.get
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - q.append
    - <builtin>.hasattr
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 2
    IfCount: 6
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e790>
    - <ast.Constant object at 0x7f734c43e760>
    - <ast.Constant object at 0x7f734c43e340>
    - <ast.Constant object at 0x7f734c43e3a0>
    argNames:
    - G
    - s
    - t
    - flow_func
    - cutoff
    - auxiliary
    - residual
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 239
    functionName: networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths
    functionSourceFile: networkx.algorithms.connectivity.disjoint_paths
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - itertools.filterfalse
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.sum
    - path.reverse
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - attr.copy
    - newdict.update
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.enumerate
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - edges.append
    - networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths
    - R.edges
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - attr.get
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - q.append
    - G.is_directed
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - <builtin>.float
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.get
    - G.edges
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.algorithms.connectivity.disjoint_paths._unique_everseen
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - path.append
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - iterable
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 400
    functionName: networkx.algorithms.connectivity.disjoint_paths._unique_everseen
    functionSourceFile: networkx.algorithms.connectivity.disjoint_paths
    functionUses: 1
    functionsReached:
    - itertools.filterfalse
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.filterfalse
    functionSourceFile: itertools
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.connectivity.kcutsets
    functionSourceFile: networkx.algorithms.connectivity.kcutsets
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - cut
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 227
    functionName: networkx.algorithms.connectivity.kcutsets._is_separating_set
    functionSourceFile: networkx.algorithms.connectivity.kcutsets
    functionUses: 191
    functionsReached:
    - networkx.restricted_view
    - <builtin>.len
    - networkx.is_connected
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.transitive_closure
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cmap.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.antichains
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: S.update
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: S_ancestors.update
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.restricted_view
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.efficiency_measures
    functionSourceFile: networkx.algorithms.efficiency_measures
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: targets.items
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism
    functionSourceFile: networkx.algorithms.isomorphism
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.ismags
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - iterable
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 132
    functionName: networkx.algorithms.isomorphism.ismags.are_all_equal
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 10
    functionsReached:
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.next
    - <builtin>.all
    linkageType: pythonLinkage
    raised:
    - NotImplementedError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73458e0bb0>
    argNames:
    - items
    - test
    - check
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 162
    functionName: networkx.algorithms.isomorphism.ismags.make_partition
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 12
    functionsReached:
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - part.add
    - <builtin>.iter
    - itertools.combinations
    - <builtin>.set
    - <builtin>.all
    - <builtin>.next
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - thing1
    - thing2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 581
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - thing1
    - thing2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 570
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - node1
    - node2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1131
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    functionSourceFile: ''
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: part.add
    functionSourceFile: <builtin>
    functionUses: 13
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - partition
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 230
    functionName: networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 11
    functionsReached:
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - n_colors
    - e_colors
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 247
    functionName: networkx.algorithms.isomorphism.ismags.color_degree_by_node
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 11
    functionsReached:
    - G.is_directed
    - <builtin>.len
    - G.adjacency
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - edge_dict
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 304
    functionName: networkx.algorithms.isomorphism.ismags.EdgeLookup.__init__
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - edge
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 307
    functionName: networkx.algorithms.isomorphism.ismags.EdgeLookup.__getitem__
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 312
    functionName: networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc61a60>
    - <ast.Constant object at 0x7f734cc61070>
    - <ast.Constant object at 0x7f734cc612e0>
    argNames:
    - self
    - graph
    - subgraph
    - node_match
    - edge_match
    - cache
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 488
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.__init__
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.__init__
    - <builtin>.zip
    - subgraph.is_directed
    - graph.is_directed
    - <builtin>.enumerate
    - <builtin>.all
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions
    - networkx.algorithms.isomorphism.ismags.make_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - part.add
    - <builtin>.list
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - <builtin>.range
    - sgc_to_gc.items
    - itertools.combinations
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: subgraph.is_directed
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 1
    IfCount: 9
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - thing_matcher
    - sg_things
    - g_things
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 543
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 1
    functionsReached:
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - networkx.algorithms.isomorphism.ismags.make_partition
    - <builtin>.range
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - <builtin>.zip
    - part.add
    - <builtin>.list
    - sgc_to_gc.items
    - <builtin>.iter
    - <builtin>.len
    - itertools.combinations
    - <builtin>.set
    - <builtin>.all
    - <builtin>.next
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sgc_to_gc.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 4
    IfCount: 7
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e520>
    argNames:
    - self
    - symmetry
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 638
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 4
    functionsReached:
    - new_partitions.append
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - possible_bottoms.extend
    - cosets.items
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - frozenset.intersection
    - itertools.permutations
    - <builtin>.enumerate
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates
    - <builtin>.map
    - lookahead_candidates.items
    - mapping.keys
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - <builtin>.any
    - orbit_id.update
    - graph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - subgraph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    - counts.items
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - cand_sets.values
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    - <builtin>.tuple
    - part.add
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - sg_deg.items
    - g_deg.items
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.dict
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - itertools.combinations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 757
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 6
    functionsReached:
    - new_partitions.append
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - possible_bottoms.extend
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - itertools.permutations
    - <builtin>.enumerate
    - <builtin>.map
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - orbit_id.update
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - <builtin>.tuple
    - part.add
    - <builtin>.list
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - itertools.combinations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cosets.items
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 833
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 6
    functionsReached:
    - collections.defaultdict
    - <builtin>.dict
    - <builtin>.frozenset
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 693
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 5
    functionsReached:
    - G.is_directed
    - sg_deg.items
    - g_deg.items
    - counts.items
    - <builtin>.len
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - <builtin>.enumerate
    - <builtin>.all
    - G.adjacency
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lookahead_candidates.items
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cand_sets.values
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms.<lambda1>
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: frozenset.intersection
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 3
    IfCount: 12
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d39b160>
    argNames:
    - self
    - sgn
    - candidate_sets
    - constraints
    - to_be_mapped
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 877
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 7
    functionsReached:
    - candidate_sets.copy
    - subgraph_adj.keys
    - queue.append
    - rev_mapping.copy
    - subgraph.is_directed
    - <builtin>.min
    - <builtin>.list
    - frozenset.intersection
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - <builtin>.enumerate
    - mapping.keys
    - <builtin>.frozenset
    - graph_adj.keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: g_deg.items
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: counts.items
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sg_deg.items
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d4253a0>
    argNames:
    - self
    - symmetry
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 715
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.largest_common_subgraph
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - new_partitions.append
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - possible_bottoms.extend
    - cosets.items
    - networkx.algorithms.isomorphism.ismags.ISMAGS._remove_node
    - frozenset.intersection
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - itertools.permutations
    - <builtin>.enumerate
    - <builtin>.map
    - mapping.keys
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - <builtin>.any
    - orbit_id.update
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - graph_adj.keys
    - subgraph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - candidate_sets.values
    - networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._largest_common_subgraph
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    - <builtin>.tuple
    - part.add
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.dict
    - itertools.combinations
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - left_to_be_mapped.add
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: candidate_sets.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7345b49c70>
    argNames:
    - self
    - candidates
    - constraints
    - to_be_mapped
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1021
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._largest_common_subgraph
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 1
    functionsReached:
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.append
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._remove_node
    - frozenset.intersection
    - <builtin>.enumerate
    - mapping.keys
    - graph_adj.keys
    - subgraph_adj.keys
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - <builtin>.frozenset
    - networkx.algorithms.isomorphism.ismags.ISMAGS._largest_common_subgraph
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.min
    - left_to_be_mapped.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - cls
    - graph
    - partition
    - edge_colors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 857
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 9
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - <builtin>.enumerate
    - <builtin>.all
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - part.add
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - itertools.combinations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 7
    IfCount: 6
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - graph
    - top_partition
    - bottom_partition
    - edge_colors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 1207
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 7
    functionsReached:
    - new_partitions.append
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - possible_bottoms.extend
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - itertools.permutations
    - <builtin>.enumerate
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - orbit_id.update
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - top.copy
    - networkx.algorithms.isomorphism.ismags.make_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - part.add
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - collections.Counter
    - itertools.product
    - collections.defaultdict
    - permutations.add
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - n_p.extend
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - itertools.combinations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccd6cd0>
    argNames:
    - self
    - symmetry
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 793
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - new_partitions.append
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - possible_bottoms.extend
    - cosets.items
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - frozenset.intersection
    - itertools.permutations
    - networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_is_isomorphic
    - <builtin>.enumerate
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates
    - <builtin>.map
    - lookahead_candidates.items
    - mapping.keys
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - <builtin>.any
    - orbit_id.update
    - graph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - subgraph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    - counts.items
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - cand_sets.values
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    - <builtin>.tuple
    - part.add
    - networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_isomorphisms_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - sg_deg.items
    - g_deg.items
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.dict
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - itertools.combinations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8b50>
    argNames:
    - self
    - symmetry
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 806
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 1
    functionsReached:
    - new_partitions.append
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - possible_bottoms.extend
    - cosets.items
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - frozenset.intersection
    - itertools.permutations
    - <builtin>.enumerate
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates
    - <builtin>.map
    - lookahead_candidates.items
    - mapping.keys
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - <builtin>.any
    - orbit_id.update
    - graph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - subgraph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    - counts.items
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - cand_sets.values
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    - <builtin>.tuple
    - part.add
    - networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_isomorphisms_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - sg_deg.items
    - g_deg.items
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.dict
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - itertools.combinations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8dc0>
    argNames:
    - self
    - symmetry
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 829
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_isomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 3
    functionsReached:
    - new_partitions.append
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - possible_bottoms.extend
    - cosets.items
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - frozenset.intersection
    - itertools.permutations
    - <builtin>.enumerate
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates
    - <builtin>.map
    - lookahead_candidates.items
    - mapping.keys
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - <builtin>.any
    - orbit_id.update
    - graph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - subgraph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    - counts.items
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - cand_sets.values
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    - <builtin>.tuple
    - part.add
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - sg_deg.items
    - g_deg.items
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.dict
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - itertools.combinations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8430>
    argNames:
    - self
    - symmetry
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 821
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS.isomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - new_partitions.append
    - candidate_sets.copy
    - <builtin>.sorted
    - queue.extend
    - queue.append
    - <builtin>.zip
    - networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes
    - subgraph.is_directed
    - rev_mapping.copy
    - possible_bottoms.extend
    - cosets.items
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - frozenset.intersection
    - itertools.permutations
    - <builtin>.enumerate
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates
    - <builtin>.map
    - lookahead_candidates.items
    - mapping.keys
    - <builtin>.all
    - new_bot.insert
    - new_bottom.append
    - <builtin>.any
    - orbit_id.update
    - graph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - subgraph_adj.keys
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry
    - counts.items
    - <builtin>.len
    - <builtin>.set
    - new_top.insert
    - <builtin>.next
    - possible_bottoms.pop
    - <builtin>.frozenset
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - top.copy
    - cand_sets.values
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets
    - <builtin>.tuple
    - part.add
    - networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_isomorphisms_iter
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - itertools.product
    - collections.Counter
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions
    - collections.defaultdict
    - permutations.add
    - sg_deg.items
    - g_deg.items
    - <builtin>.min
    - networkx.algorithms.isomorphism.ismags.EdgeLookup.items
    - <builtin>.dict
    - networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    - itertools.combinations
    - bot.copy
    - networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    - n_p.extend
    - networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms
    - <builtin>.hash
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - node1
    - node2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 858
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition.equal_color
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: subgraph_adj.keys
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rev_mapping.copy
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: candidate_sets.copy
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph_adj.keys
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes.<lambda1>
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._largest_common_subgraph.<lambda1>
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - node
    - nodes
    - constraints
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1089
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._remove_node
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: left_to_be_mapped.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - items
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1105
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 9
    functionsReached:
    - collections.defaultdict
    - <builtin>.sorted
    - itertools.permutations
    - <builtin>.list
    - <builtin>.len
    - itertools.product
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 5
    argDefaultValues: []
    argNames:
    - cls
    - graph
    - top
    - bottom
    - edge_colors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1130
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 8
    functionsReached:
    - new_partitions.append
    - <builtin>.sorted
    - possible_bottoms.extend
    - networkx.algorithms.isomorphism.ismags.are_all_equal
    - itertools.permutations
    - <builtin>.enumerate
    - <builtin>.all
    - new_bottom.append
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match
    - networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - possible_bottoms.pop
    - G.is_directed
    - networkx.algorithms.isomorphism.ismags.make_partition
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp.equal_color
    - part.add
    - <builtin>.list
    - networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict
    - <builtin>.iter
    - networkx.algorithms.isomorphism.ismags.color_degree_by_node
    - G.adjacency
    - networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition
    - itertools.product
    - networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match
    - collections.Counter
    - collections.defaultdict
    - n_p.extend
    - itertools.combinations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: possible_bottoms.pop
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_bottom.append
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: n_p.extend
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_partitions.append
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: possible_bottoms.extend
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - top_partition
    - bottom_partition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1181
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 8
    functionsReached:
    - permutations.add
    - <builtin>.zip
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - <builtin>.frozenset
    linkageType: pythonLinkage
    raised:
    - IndexError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: permutations.add
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - queue
    - top_partition
    - bottom_partition
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1228
    functionName: networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry
    functionSourceFile: networkx.algorithms.isomorphism.ismags
    functionUses: 8
    functionsReached:
    - <builtin>.sorted
    - queue.append
    - <builtin>.min
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: top.copy
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_top.insert
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bot.copy
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_bot.insert
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: orbit_id.update
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - G1
    - G2
    - temporal_attribute_name
    - delta
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.__init__
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - Gx_node
    - neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 100
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.one_hop
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 2
    functionsReached:
    - dates.append
    - <builtin>.max
    - <builtin>.min
    - <builtin>.isinstance
    - <builtin>.any
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dates.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - core_x
    - Gx_node
    - neighbors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 118
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.two_hop
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 1
    functionsReached:
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.one_hop
    - dates.append
    - <builtin>.max
    - <builtin>.min
    - <builtin>.all
    - <builtin>.any
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 127
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.semantic_feasibility
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 0
    functionsReached:
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.one_hop
    - dates.append
    - <builtin>.max
    - <builtin>.all
    - <builtin>.min
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.two_hop
    - <builtin>.isinstance
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - G1
    - G2
    - temporal_attribute_name
    - delta
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 145
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.__init__
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - Gx_node
    - core_x
    - pred
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 169
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_pred_dates
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 4
    functionsReached:
    - <builtin>.isinstance
    - pred_dates.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pred_dates.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - Gx_node
    - core_x
    - succ
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 185
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_succ_dates
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 4
    functionsReached:
    - <builtin>.isinstance
    - succ_dates.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: succ_dates.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - Gx_node
    - core_x
    - pred
    - succ
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 201
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.one_hop
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 3
    functionsReached:
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_pred_dates
    - dates.sort
    - succ_dates.append
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_succ_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_one
    - pred_dates.append
    - <builtin>.len
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_two
    - pred_dates.sort
    - succ_dates.sort
    - <builtin>.isinstance
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - pred_dates
    - succ_dates
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 253
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_one
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 4
    functionsReached:
    - dates.sort
    - <builtin>.len
    - <builtin>.any
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - pred_dates
    - succ_dates
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 270
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_two
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 4
    functionsReached:
    - <builtin>.len
    - pred_dates.sort
    - succ_dates.sort
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - Gx_node
    - core_x
    - pred
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 211
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.two_hop_pred
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 1
    functionsReached:
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_succ_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_one
    - <builtin>.all
    - <builtin>.any
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_pred_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.succs
    - <builtin>.len
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_two
    - Gx.successors
    - Gx.predecessors
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.one_hop
    - succ_dates.append
    - pred_dates.sort
    - succ_dates.sort
    - <builtin>.isinstance
    - pred.append
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.preds
    - pred_dates.append
    - succ.append
    - dates.sort
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23b20>
    argNames:
    - self
    - Gx
    - core_x
    - v
    - Gx_node
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 241
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.preds
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 3
    functionsReached:
    - pred.append
    - Gx.predecessors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd48bb0>
    argNames:
    - self
    - Gx
    - core_x
    - v
    - Gx_node
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 247
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.succs
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 3
    functionsReached:
    - Gx.successors
    - succ.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - Gx
    - Gx_node
    - core_x
    - succ
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 226
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.two_hop_succ
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 1
    functionsReached:
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_succ_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_one
    - <builtin>.all
    - <builtin>.any
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_pred_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.succs
    - <builtin>.len
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_two
    - Gx.successors
    - Gx.predecessors
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.one_hop
    - succ_dates.append
    - pred_dates.sort
    - succ_dates.sort
    - <builtin>.isinstance
    - pred.append
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.preds
    - pred_dates.append
    - succ.append
    - dates.sort
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Gx.predecessors
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pred.append
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Gx.successors
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: succ.append
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dates.sort
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pred_dates.sort
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: succ_dates.sort
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 287
    functionName: networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.semantic_feasibility
    functionSourceFile: networkx.algorithms.isomorphism.temporalisomorphvf2
    functionUses: 0
    functionsReached:
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_succ_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_one
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.two_hop_pred
    - <builtin>.all
    - <builtin>.any
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_pred_dates
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.succs
    - dates.sort
    - <builtin>.len
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_two
    - Gx.successors
    - Gx.predecessors
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.one_hop
    - succ_dates.append
    - pred_dates.sort
    - succ_dates.sort
    - <builtin>.isinstance
    - pred.append
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.two_hop_succ
    - networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.preds
    - succ.append
    - pred_dates.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.tree_isomorphism
    functionSourceFile: networkx.algorithms.isomorphism.tree_isomorphism
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - t1
    - root1
    - t2
    - root2
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 30
    functionName: networkx.algorithms.isomorphism.tree_isomorphism.root_trees
    functionSourceFile: networkx.algorithms.isomorphism.tree_isomorphism
    functionUses: 2
    functionsReached:
    - networkx.number_of_nodes
    - datadict.update
    - namemap2.items
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - namemap1.items
    - <builtin>.len
    - <builtin>.enumerate
    - networkx.bfs_edges
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_of_nodes
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: namemap1.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: namemap2.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 4
    argDefaultValues: []
    argNames:
    - t1
    - root1
    - t2
    - root2
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 77
    functionName: networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism
    functionSourceFile: networkx.algorithms.isomorphism.tree_isomorphism
    functionUses: 1
    functionsReached:
    - networkx.number_of_nodes
    - <builtin>.sorted
    - <builtin>.zip
    - keydict.get
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - namemap2.items
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - stack.pop
    - namemap1.items
    - <builtin>.len
    - dT.out_degree
    - dT.successors
    - networkx.shortest_path_length
    - networkx.is_tree
    - <builtin>.list
    - networkx.bfs_edges
    - networkx.algorithms.isomorphism.tree_isomorphism.root_trees
    - stack.extend
    - collections.defaultdict
    - <builtin>.range
    - isomorphism.append
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dT.out_degree
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dT.successors
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: isomorphism.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - t1
    - t2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 197
    functionName: networkx.algorithms.isomorphism.tree_isomorphism.tree_isomorphism
    functionSourceFile: networkx.algorithms.isomorphism.tree_isomorphism
    functionUses: 0
    functionsReached:
    - networkx.number_of_nodes
    - <builtin>.sorted
    - networkx.faster_could_be_isomorphic
    - <builtin>.zip
    - keydict.get
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - namemap2.items
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - stack.pop
    - namemap1.items
    - <builtin>.len
    - networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism
    - dT.out_degree
    - dT.successors
    - networkx.shortest_path_length
    - networkx.is_tree
    - networkx.center
    - <builtin>.list
    - networkx.bfs_edges
    - networkx.algorithms.isomorphism.tree_isomorphism.root_trees
    - stack.extend
    - collections.defaultdict
    - <builtin>.range
    - isomorphism.append
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.faster_could_be_isomorphic
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.center
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.vf2userfunc
    functionSourceFile: networkx.algorithms.isomorphism.vf2userfunc
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 39
    functionName: networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    functionSourceFile: networkx.algorithms.isomorphism.vf2userfunc
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4df0>
    - <ast.Constant object at 0x7f734b5c4a60>
    argNames:
    - self
    - G1
    - G2
    - node_match
    - edge_match
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 76
    functionName: networkx.algorithms.isomorphism.vf2userfunc.GraphMatcher.__init__
    functionSourceFile: networkx.algorithms.isomorphism.vf2userfunc
    functionUses: 1
    functionsReached:
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - sys.getrecursionlimit
    - <builtin>.enumerate
    - G1.nodes
    - G2.nodes
    - <builtin>.int
    - GM.G2.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.len
    - <builtin>.set
    - G1.is_directed
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.__init__
    - GM.G1.successors
    - GM.G2.successors
    - sys.setrecursionlimit
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - GM.G1.predecessors
    - G2.is_directed
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - new_nodes.update
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher._is_directed_matcher
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 160
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.__init__
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 2
    functionsReached:
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - sys.getrecursionlimit
    - <builtin>.enumerate
    - G1.nodes
    - G2.nodes
    - <builtin>.int
    - GM.G2.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.len
    - <builtin>.set
    - G1.is_directed
    - GM.G1.successors
    - GM.G2.successors
    - sys.setrecursionlimit
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - GM.G1.predecessors
    - G2.is_directed
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - new_nodes.update
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher._is_directed_matcher
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63d8e0>
    - <ast.Constant object at 0x7f734cc61070>
    argNames:
    - self
    - G1
    - G2
    - node_match
    - edge_match
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 123
    functionName: networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.__init__
    functionSourceFile: networkx.algorithms.isomorphism.vf2userfunc
    functionUses: 1
    functionsReached:
    - <builtin>.super
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 628
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.__init__
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 2
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 164
    functionName: networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    functionSourceFile: networkx.algorithms.isomorphism.vf2userfunc
    functionUses: 6
    functionsReached:
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.isomorphvf2
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 644
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher._is_directed_matcher
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sys.getrecursionlimit
    functionSourceFile: sys
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sys.setrecursionlimit
    functionSourceFile: sys
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 261
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 8
    functionsReached:
    - new_nodes.update
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 694
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 8
    functionsReached:
    - new_nodes.update
    - GM.G1.successors
    - GM.G2.predecessors
    - GM.G2.successors
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - <builtin>.len
    - <builtin>.set
    - GM.G1.predecessors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 212
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher._is_directed_matcher
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 215
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.reset_recursion_limit
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - sys.setrecursionlimit
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 228
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.candidate_pairs_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.set
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 3
    IfCount: 6
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7344bdd6a0>
    - <ast.Constant object at 0x7f7344bdd670>
    argNames:
    - self
    - GM
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1056
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 9
    functionsReached:
    - new_nodes.update
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 292
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    - GM.G2.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.isomorphisms_iter
    - <builtin>.next
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    - new_nodes.update
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    - newstate.restore
    - GM.G1.successors
    - GM.G2.successors
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - <builtin>.min
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - GM.G1.predecessors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 315
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.isomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 1
    functionsReached:
    - newstate.restore
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    - GM.G1.successors
    - GM.G2.predecessors
    - GM.G2.successors
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - <builtin>.len
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - <builtin>.set
    - GM.G1.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.min
    - new_nodes.update
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 322
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 5
    functionsReached:
    - newstate.restore
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    - <builtin>.min
    - <builtin>.len
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    - <builtin>.set
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 647
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 6
    functionsReached:
    - <builtin>.set
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 52
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 24
    EdgeCount: 74
    ICount: 1
    IfCount: 52
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 728
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    functionSourceFile: ''
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: newstate.restore
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 347
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.semantic_feasibility
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 387
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    - GM.G2.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_isomorphisms_iter
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_isomorphisms_iter
    - newstate.restore
    - GM.G1.successors
    - <builtin>.min
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - GM.G1.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    - <builtin>.super
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - GM.G2.successors
    - new_nodes.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 443
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_isomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 1
    functionsReached:
    - newstate.restore
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    - GM.G1.successors
    - GM.G2.predecessors
    - GM.G2.successors
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - <builtin>.len
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - <builtin>.set
    - GM.G1.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.min
    - new_nodes.update
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 998
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_isomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 1
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 415
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_is_monomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.super
    - <builtin>.next
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_monomorphisms_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1022
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_monomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 1
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 471
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_monomorphisms_iter
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - newstate.restore
    - networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility
    - GM.G1.successors
    - GM.G2.predecessors
    - GM.G2.successors
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - <builtin>.len
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - <builtin>.set
    - GM.G1.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.min
    - new_nodes.update
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 23
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 12
    EdgeCount: 33
    ICount: 1
    IfCount: 23
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 498
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.syntactic_feasibility
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 5
    IfCount: 8
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7349b5a550>
    - <ast.Constant object at 0x7f7349b5a520>
    argNames:
    - self
    - GM
    - G1_node
    - G2_node
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1145
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 9
    functionsReached:
    - GM.G1.successors
    - GM.G2.predecessors
    - GM.G2.successors
    - GM.G1.predecessors
    - <builtin>.len
    - <builtin>.set
    - new_nodes.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 950
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 974
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_is_monomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: new_nodes.update
    functionSourceFile: <builtin>
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1119
    functionName: networkx.algorithms.isomorphism.isomorphvf2.GMState.restore
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - vector.keys
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vector.keys
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: GM.G1.predecessors
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: GM.G2.predecessors
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: GM.G1.successors
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: GM.G2.successors
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1248
    functionName: networkx.algorithms.isomorphism.isomorphvf2.DiGMState.restore
    functionSourceFile: networkx.algorithms.isomorphism.isomorphvf2
    functionUses: 0
    functionsReached:
    - vector.keys
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.matchhelpers
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - numerical_doc.replace
    - generic_doc.replace
    - categorical_doc.replace
    - tmpdoc.replace
    - types.FunctionType
    - networkx.algorithms.isomorphism.matchhelpers.copyfunc
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7342f92280>
    argNames:
    - f
    - name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 22
    functionName: networkx.algorithms.isomorphism.matchhelpers.copyfunc
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 1
    functionsReached:
    - types.FunctionType
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: types.FunctionType
    functionSourceFile: types
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a5bb4f0>
    - <ast.Constant object at 0x7f734a5bb940>
    argNames:
    - x
    - y
    - rtol
    - atol
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 29
    functionName: networkx.algorithms.isomorphism.matchhelpers.allclose
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 2
    functionsReached:
    - <builtin>.all
    - math.isclose
    - <builtin>.zip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.isclose
    functionSourceFile: math
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - attr
    - default
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 74
    functionName: networkx.algorithms.isomorphism.matchhelpers.categorical_node_match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.zip
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - data1
    - data2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.algorithms.isomorphism.matchhelpers.categorical_node_match.match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.all
    - data2.get
    - data1.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data1.get
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: data2.get
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - attr
    - default
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 92
    functionName: networkx.algorithms.isomorphism.matchhelpers.categorical_multiedge_match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.zip
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - datasets1
    - datasets2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 103
    functionName: networkx.algorithms.isomorphism.matchhelpers.categorical_multiedge_match.match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - values2.add
    - data1.get
    - <builtin>.tuple
    - data.get
    - values1.add
    - <builtin>.set
    - datasets2.values
    - datasets1.values
    - data2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: datasets1.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: datasets2.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values1.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values2.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: categorical_doc.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tmpdoc.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf263a0>
    - <ast.Constant object at 0x7f734cf26550>
    argNames:
    - attr
    - default
    - rtol
    - atol
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 159
    functionName: networkx.algorithms.isomorphism.matchhelpers.numerical_node_match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.zip
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - data1
    - data2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 173
    functionName: networkx.algorithms.isomorphism.matchhelpers.numerical_node_match.match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - data1.get
    - math.isclose
    - <builtin>.zip
    - networkx.algorithms.isomorphism.matchhelpers.allclose
    - <builtin>.all
    - data2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc06b50>
    - <ast.Constant object at 0x7f734bc06b20>
    argNames:
    - attr
    - default
    - rtol
    - atol
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 184
    functionName: networkx.algorithms.isomorphism.matchhelpers.numerical_multiedge_match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.zip
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - datasets1
    - datasets2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 195
    functionName: networkx.algorithms.isomorphism.matchhelpers.numerical_multiedge_match.match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - values2.append
    - values2.sort
    - values1.sort
    - data1.get
    - <builtin>.zip
    - math.isclose
    - <builtin>.tuple
    - data.get
    - networkx.algorithms.isomorphism.matchhelpers.allclose
    - datasets2.values
    - datasets1.values
    - <builtin>.all
    - values1.append
    - data2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values1.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values2.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values1.sort
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values2.sort
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numerical_doc.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - attr
    - default
    - op
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 259
    functionName: networkx.algorithms.isomorphism.matchhelpers.generic_node_match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.zip
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - data1
    - data2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 268
    functionName: networkx.algorithms.isomorphism.matchhelpers.generic_node_match.match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - data1.get
    - data2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - attr
    - default
    - op
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 281
    functionName: networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.zip
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - datasets1
    - datasets2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 326
    functionName: networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match.match
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached:
    - values2.append
    - data1.get
    - <builtin>.zip
    - <builtin>.tuple
    - itertools.permutations
    - datasets2.values
    - datasets1.values
    - <builtin>.map
    - <builtin>.all
    - values1.append
    - data2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match.match.<lambda1>
    functionSourceFile: networkx.algorithms.isomorphism.matchhelpers
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: generic_doc.replace
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.isomorphism.isomorph
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 7
    IfCount: 7
    argCount: 3
    argDefaultValues: []
    argNames:
    - G1
    - G2
    - properties
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 20
    functionName: networkx.algorithms.isomorphism.isomorph.could_be_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 1
    functionsReached:
    - G1.degree
    - itertools.chain.from_iterable
    - <builtin>.sorted
    - networkx.find_cliques
    - G1_props.append
    - <builtin>.tuple
    - G2_props.append
    - <builtin>.set
    - networkx.triangles
    - G2.order
    - G1.order
    - G2.degree
    - networkx.algorithms.isomorphism.isomorph.could_be_isomorphic._properties_consistent
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 70
    functionName: networkx.algorithms.isomorphism.isomorph.could_be_isomorphic._properties_consistent
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - <builtin>.tuple
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1.degree
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G1_props.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2.degree
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G2_props.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.triangles
    functionSourceFile: ''
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 106
    functionName: networkx.algorithms.isomorphism.isomorph.graph_could_be_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 0
    functionsReached:
    - G1.degree
    - itertools.chain.from_iterable
    - <builtin>.sorted
    - networkx.find_cliques
    - G1_props.append
    - <builtin>.tuple
    - G2_props.append
    - networkx.algorithms.isomorphism.isomorph.could_be_isomorphic
    - <builtin>.set
    - networkx.triangles
    - G2.order
    - G1.order
    - G2.degree
    - networkx.algorithms.isomorphism.isomorph.could_be_isomorphic._properties_consistent
    - warnings.warn
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 124
    functionName: networkx.algorithms.isomorphism.isomorph.fast_could_be_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 1
    functionsReached:
    - G1.degree
    - props1.sort
    - networkx.triangles
    - G2.order
    - G1.order
    - G2.degree
    - props2.sort
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: props1.sort
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: props2.sort
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 161
    functionName: networkx.algorithms.isomorphism.isomorph.fast_graph_could_be_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 0
    functionsReached:
    - G1.degree
    - props1.sort
    - props2.sort
    - networkx.triangles
    - networkx.algorithms.isomorphism.isomorph.fast_could_be_isomorphic
    - G2.order
    - G1.order
    - G2.degree
    - warnings.warn
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 179
    functionName: networkx.algorithms.isomorphism.isomorph.faster_could_be_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 1
    functionsReached:
    - G1.degree
    - <builtin>.sorted
    - G2.order
    - G1.order
    - G2.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G1
    - G2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 208
    functionName: networkx.algorithms.isomorphism.isomorph.faster_graph_could_be_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 0
    functionsReached:
    - G1.degree
    - <builtin>.sorted
    - networkx.algorithms.isomorphism.isomorph.faster_could_be_isomorphic
    - G2.order
    - G1.order
    - G2.degree
    - warnings.warn
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba44790>
    - <ast.Constant object at 0x7f734ba44b20>
    argNames:
    - G1
    - G2
    - node_match
    - edge_match
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 230
    functionName: networkx.algorithms.isomorphism.isomorph.is_isomorphic
    functionSourceFile: networkx.algorithms.isomorphism.isomorph
    functionUses: 0
    functionsReached:
    - networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.__init__
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize
    - sys.getrecursionlimit
    - <builtin>.enumerate
    - G1.nodes
    - G2.nodes
    - <builtin>.int
    - gm.is_isomorphic
    - GM.G2.predecessors
    - networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.__init__
    - G1.is_directed
    - networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.__init__
    - GM.G1.successors
    - GM.G2.successors
    - sys.setrecursionlimit
    - networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__
    - <builtin>.super
    - G2.is_directed
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize
    - GM.G1.predecessors
    - networkx.algorithms.isomorphism.vf2userfunc.GraphMatcher.__init__
    - new_nodes.update
    - networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher._is_directed_matcher
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gm.is_isomorphic
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite
    functionSourceFile: networkx.algorithms.bipartite
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.matrix
    functionSourceFile: networkx.algorithms.bipartite.matrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e220>
    - <ast.Constant object at 0x7f734b66e1f0>
    - <ast.Constant object at 0x7f734b66e550>
    - <ast.Constant object at 0x7f734b66e8b0>
    argNames:
    - G
    - row_order
    - column_order
    - dtype
    - weight
    - format
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 16
    functionName: networkx.algorithms.bipartite.matrix.biadjacency_matrix
    functionSourceFile: networkx.algorithms.bipartite.matrix
    functionUses: 1
    functionsReached:
    - d.get
    - A.asformat
    - <builtin>.zip
    - itertools.count
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - G.number_of_edges
    - scipy.sparse.coo_array
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d612970>
    - <ast.Constant object at 0x7f734b101ca0>
    argNames:
    - A
    - create_using
    - edge_attribute
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 115
    functionName: networkx.algorithms.bipartite.matrix.from_biadjacency_matrix
    functionSourceFile: networkx.algorithms.bipartite.matrix
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.zip
    - networkx.convert_matrix._csr_gen_triples
    - A.data.tolist
    - numpy.diff
    - networkx.convert_matrix._csc_gen_triples
    - numpy.repeat
    - attr.copy
    - newdict.update
    - v.item
    - src_indices.tolist
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.int
    - networkx.convert_matrix._dok_gen_triples
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - dst_indices.tolist
    - networkx.convert_matrix._coo_gen_triples
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.convert_matrix._generate_weighted_edges
    - A.items
    - <builtin>.iter
    - numpy.arange
    - <builtin>.range
    - A.row.tolist
    - A.col.tolist
    - A.tocoo
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.edgelist
    functionSourceFile: networkx.algorithms.bipartite.edgelist
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4340>
    - <ast.Constant object at 0x7f734b5c4370>
    - <ast.Constant object at 0x7f734b5c4490>
    - <ast.Constant object at 0x7f734b5c4730>
    argNames:
    - G
    - path
    - comments
    - delimiter
    - data
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 33
    functionName: networkx.algorithms.bipartite.edgelist.write_edgelist
    functionSourceFile: networkx.algorithms.bipartite.edgelist
    functionUses: 0
    functionsReached:
    - delimiter.join
    - line.encode
    - path.write
    - edge.extend
    - G.nodes.items
    - <builtin>.map
    - networkx.algorithms.bipartite.edgelist.generate_edgelist
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc234c0>
    - <ast.Constant object at 0x7f734cc23790>
    argNames:
    - G
    - delimiter
    - data
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.algorithms.bipartite.edgelist.generate_edgelist
    functionSourceFile: networkx.algorithms.bipartite.edgelist
    functionUses: 1
    functionsReached:
    - delimiter.join
    - edge.extend
    - <builtin>.map
    - G.nodes.items
    - G.edges
    linkageType: pythonLinkage
    raised:
    - AttributeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edge.extend
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf820>
    - <ast.Constant object at 0x7f734a4cf130>
    - <ast.Constant object at 0x7f734a4cf4c0>
    - <ast.Constant object at 0x7f734a4cf3a0>
    - <ast.Constant object at 0x7f734a4cffa0>
    argNames:
    - lines
    - comments
    - delimiter
    - create_using
    - nodetype
    - data
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 151
    functionName: networkx.algorithms.bipartite.edgelist.parse_edgelist
    functionSourceFile: networkx.algorithms.bipartite.edgelist
    functionUses: 1
    functionsReached:
    - edgedata.update
    - <builtin>.zip
    - s.pop
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - ast.literal_eval
    - attr_dict.update
    - line.rstrip
    - line.find
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - TypeError
    - IndexError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5e1f70>
    - <ast.Constant object at 0x7f734b5e1e80>
    - <ast.Constant object at 0x7f734cdf4820>
    - <ast.Constant object at 0x7f734cdf45e0>
    - <ast.Constant object at 0x7f734a9edaf0>
    - <ast.Constant object at 0x7f734a9edbe0>
    - <ast.Constant object at 0x7f734a9ed250>
    argNames:
    - path
    - comments
    - delimiter
    - create_using
    - nodetype
    - data
    - edgetype
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 273
    functionName: networkx.algorithms.bipartite.edgelist.read_edgelist
    functionSourceFile: networkx.algorithms.bipartite.edgelist
    functionUses: 0
    functionsReached:
    - edgedata.update
    - <builtin>.zip
    - s.pop
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - ast.literal_eval
    - attr_dict.update
    - line.decode
    - line.rstrip
    - line.find
    - networkx.algorithms.bipartite.edgelist.parse_edgelist
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.dict
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.centrality
    functionSourceFile: networkx.algorithms.bipartite.centrality
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 7
    functionName: networkx.algorithms.bipartite.centrality.degree_centrality
    functionSourceFile: networkx.algorithms.bipartite.centrality
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    - G.degree
    - centrality.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: centrality.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 82
    functionName: networkx.algorithms.bipartite.centrality.betweenness_centrality
    functionSourceFile: networkx.algorithms.bipartite.centrality
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.divmod
    - <builtin>.set
    - networkx.betweenness_centrality
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.divmod
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.betweenness_centrality
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16fa0>
    argNames:
    - G
    - nodes
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 186
    functionName: networkx.algorithms.bipartite.centrality.closeness_centrality
    functionSourceFile: networkx.algorithms.bipartite.centrality
    functionUses: 0
    functionsReached:
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.float
    - seen.add
    - sp.values
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sp.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.projection
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7343402a60>
    argNames:
    - B
    - nodes
    - multigraph
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 19
    functionName: networkx.algorithms.bipartite.projection.projected_graph
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 0
    functionsReached:
    - G.graph.update
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f910>
    argNames:
    - B
    - nodes
    - ratio
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 124
    functionName: networkx.algorithms.bipartite.projection.weighted_projected_graph
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.NodeView.__iter__
    - G.graph.update
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx._clear_cache
    - keydict.get
    - attr.copy
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - B.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - NetworkXAlgorithmError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B.is_directed
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - B
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 225
    functionName: networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.NodeView.__iter__
    - G.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - keydict.get
    - attr.copy
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.sum
    - B.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9c2e0>
    argNames:
    - B
    - nodes
    - jaccard
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 319
    functionName: networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.NodeView.__iter__
    - G.graph.update
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx._clear_cache
    - <builtin>.min
    - keydict.get
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - attr.copy
    - B.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41ac0>
    argNames:
    - B
    - nodes
    - weight_function
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 419
    functionName: networkx.algorithms.bipartite.projection.generic_weighted_projected_graph
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.NodeView.__iter__
    - G.graph.update
    - networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.weight_function
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx._clear_cache
    - keydict.get
    - attr.copy
    - <builtin>.iter
    - <builtin>.len
    - newdict.update
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - B.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 515
    functionName: networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.weight_function
    functionSourceFile: networkx.algorithms.bipartite.projection
    functionUses: 1
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.spectral
    functionSourceFile: networkx.algorithms.bipartite.spectral
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24490>
    - <ast.Constant object at 0x7f734cd24850>
    argNames:
    - G
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.algorithms.bipartite.spectral.spectral_bipartivity
    functionSourceFile: networkx.algorithms.bipartite.spectral
    functionUses: 0
    functionsReached:
    - expA.diagonal
    - expA.item
    - <builtin>.range
    - <builtin>.zip
    - scipy.linalg.expm
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - coshA.item
    - <builtin>.float
    - coshA.diagonal
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.expm
    functionSourceFile: scipy
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: coshA.diagonal
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: expA.diagonal
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: coshA.item
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: expA.item
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.redundancy
    functionSourceFile: networkx.algorithms.bipartite.redundancy
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 97
    functionName: networkx.algorithms.bipartite.redundancy._node_redundancy
    functionSourceFile: networkx.algorithms.bipartite.redundancy
    functionUses: 191
    functionsReached:
    - <builtin>.len
    - itertools.combinations
    - <builtin>.set
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.generators
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - collections.deque
    - G.reverse
    - unmatched.append
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - networkx.algorithms.approximation.clique.large_clique_size
    - B_cal_prime.add
    - queue.popleft
    - networkx.algorithms.chordal.chordal_graph_cliques
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - unseen.remove
    - marked.update
    - A.edges
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.utils.decorators.nodes_or_number
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.int
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.bfs_layers
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.non_edges
    - d.copy
    - networkx.algorithms.smallworld.sigma
    - networkx.classes.reportviews.InEdgeView.__init__
    - G.successors
    - networkx.is_dominating_set
    - length.items
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7347beb340>
    argNames:
    - n1
    - n2
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 26
    functionName: networkx.algorithms.bipartite.generators.complete_bipartite_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e4f0>
    - <ast.Constant object at 0x7f734b66e3d0>
    argNames:
    - aseq
    - bseq
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 72
    functionName: networkx.algorithms.bipartite.generators.configuration_model
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - keylist.append
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - b.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - seed.shuffle
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - lena
    - lenb
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 598
    functionName: networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 7
    functionsReached:
    - <builtin>.range
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.zip
    - attr.copy
    - <builtin>.iter
    - <builtin>.dict
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.set_node_attributes
    - b.update
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b783160>
    argNames:
    - aseq
    - bseq
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 143
    functionName: networkx.algorithms.bipartite.generators.havel_hakimi_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - bstubs.sort
    - <builtin>.zip
    - keydict.get
    - astubs.pop
    - <builtin>.sum
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - b.update
    - bstubs.remove
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.__iter__
    - astubs.sort
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: astubs.sort
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: astubs.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bstubs.sort
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bstubs.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 5
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf3f70>
    argNames:
    - aseq
    - bseq
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 218
    functionName: networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - bstubs.sort
    - <builtin>.zip
    - keydict.get
    - astubs.pop
    - <builtin>.sum
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - b.update
    - bstubs.remove
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.__iter__
    - astubs.sort
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 6
    IfCount: 6
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc6e190>
    argNames:
    - aseq
    - bseq
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 292
    functionName: networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - bstubs.sort
    - <builtin>.zip
    - keydict.get
    - <builtin>.sum
    - astubs.pop
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - large.pop
    - b.update
    - bstubs.remove
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - stubs.append
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.__iter__
    - astubs.sort
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: large.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: stubs.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734c4487f0>
    - <ast.Constant object at 0x7f734c448f70>
    argNames:
    - aseq
    - p
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 371
    functionName: networkx.algorithms.bipartite.generators.preferential_attachment_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - vv.remove
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - functools.reduce
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - b.update
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.generators.preferential_attachment_graph.<lambda1>
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vv.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 3
    IfCount: 6
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b101460>
    - <ast.Constant object at 0x7f734b101220>
    argNames:
    - n
    - m
    - p
    - seed
    - directed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 443
    functionName: networkx.algorithms.bipartite.generators.random_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.zip
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - b.update
    - <builtin>.iter
    - networkx.complete_bipartite_graph
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - <builtin>.dict
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.complete_bipartite_graph
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a820>
    - <ast.Constant object at 0x7f734b77a790>
    argNames:
    - n
    - m
    - k
    - seed
    - directed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 530
    functionName: networkx.algorithms.bipartite.generators.gnmk_random_graph
    functionSourceFile: networkx.algorithms.bipartite.generators
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - b.update
    - <builtin>.list
    - <builtin>.iter
    - networkx.complete_bipartite_graph
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - seed.choice
    - <builtin>.dict
    - networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: b.update
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.extendability
    functionSourceFile: networkx.algorithms.bipartite.extendability
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.is_bipartite
    functionSourceFile: ''
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.hopcroft_karp_matching
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: maximum_matching.keys
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.node_disjoint_paths
    functionSourceFile: ''
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.covering
    functionSourceFile: networkx.algorithms.bipartite.covering
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf640>
    argNames:
    - G
    - matching_algorithm
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 14
    functionName: networkx.algorithms.bipartite.covering.min_edge_cover
    functionSourceFile: networkx.algorithms.bipartite.covering
    functionUses: 0
    functionsReached:
    - networkx.isolates
    - queue.append
    - maximum_matching.items
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.bipartite.basic.sets
    - seen.add
    - networkx.algorithms.bipartite.basic.color
    - nextlevel.append
    - color.update
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - seen.update
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - <builtin>.next
    - itertools.chain
    - functools.partial
    - leftmatches.items
    - G.order
    - rightmatches.items
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - queue.pop
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - networkx.algorithms.covering.min_edge_cover
    - min_cover.add
    - networkx.utils.arbitrary_element
    - networkx.algorithms.components.connected.connected_components
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.number_of_isolates
    - <builtin>.dict
    - c.items
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - queue.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.covering
    functionSourceFile: networkx.algorithms.covering
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.number_of_isolates
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: maximum_matching.items
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: min_cover.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.matching
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 127
    functionName: networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 193
    functionsReached:
    - queue.append
    - queue.popleft
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: queue.popleft
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 144
    functionName: networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 193
    functionsReached:
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: leftmatches.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rightmatches.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: newLayer.setdefault
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: layer.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unmatched.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matching.copy
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 309
    functionName: networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 191
    functionsReached:
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - preds.pop
    - pred.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pred.pop
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - G
    - v
    - matched_edges
    - unmatched_edges
    - targets
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 324
    functionName: networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 192
    functionsReached:
    - stack.append
    - visited.add
    - stack.pop
    - <builtin>.iter
    - <builtin>.set
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8a00>
    argNames:
    - u
    - along_matched
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 347
    functionName: networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 193
    functionsReached:
    - stack.append
    - visited.add
    - stack.pop
    - <builtin>.iter
    - <builtin>.set
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - matching
    - targets
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 386
    functionName: networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 191
    functionsReached:
    - stack.append
    - visited.add
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - <builtin>.tuple
    - stack.pop
    - <builtin>.iter
    - <builtin>.set
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - matching.items
    - <builtin>.next
    - <builtin>.frozenset
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4310>
    - <ast.Constant object at 0x7f734b5c4b20>
    argNames:
    - G
    - top_nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 506
    functionName: networkx.algorithms.bipartite.matching.minimum_weight_full_matching
    functionSourceFile: networkx.algorithms.bipartite.matching
    functionUses: 0
    functionsReached:
    - networkx.algorithms.bipartite.sets
    - d.get
    - d.update
    - scipy.optimize.linear_sum_assignment
    - A.asformat
    - <builtin>.zip
    - <builtin>.list
    - networkx.algorithms.bipartite.matrix.biadjacency_matrix
    - d.items
    - itertools.count
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - G.number_of_edges
    - scipy.sparse.coo_array
    - G.edges
    - numpy.full
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.optimize.linear_sum_assignment
    functionSourceFile: scipy
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.cluster
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - nu
    - nv
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 15
    functionName: networkx.algorithms.bipartite.cluster.cc_dot
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 192
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - nu
    - nv
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 19
    functionName: networkx.algorithms.bipartite.cluster.cc_max
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.max
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - nu
    - nv
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 23
    functionName: networkx.algorithms.bipartite.cluster.cc_min
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77abb0>
    - <ast.Constant object at 0x7f734b77aa30>
    argNames:
    - G
    - nodes
    - mode
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 136
    functionName: networkx.algorithms.bipartite.cluster.average_clustering
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 0
    functionsReached:
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.bipartite.cluster.cc_dot
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 281
    functionName: networkx.algorithms.bipartite.cluster._threepaths
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 191
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 262
    functionName: networkx.algorithms.bipartite.cluster._four_cycles
    functionSourceFile: networkx.algorithms.bipartite.cluster
    functionUses: 191
    functionsReached:
    - <builtin>.len
    - v_neighbors.intersection
    - <builtin>.set
    - seen.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v_neighbors.intersection
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.basic
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - v
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 60
    functionName: networkx.algorithms.bipartite.basic.color.neighbors
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 0
    functionsReached:
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.predecessors
    - itertools.chain.from_iterable
    - networkx.classes.digraph.DiGraph.successors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: color.update
    functionSourceFile: <builtin>
    functionUses: 199
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: X.issubset
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Y.isdisjoint
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Y.issubset
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: X.isdisjoint
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: c.items
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - B
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 226
    functionName: networkx.algorithms.bipartite.basic.density
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - networkx.number_of_edges
    - B.is_directed
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41d90>
    argNames:
    - B
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 279
    functionName: networkx.algorithms.bipartite.basic.degrees
    functionSourceFile: networkx.algorithms.bipartite.basic
    functionUses: 0
    functionsReached:
    - B.degree
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B.degree
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.link_analysis
    functionSourceFile: networkx.algorithms.bipartite.link_analysis
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 9
    argDefaultValues: []
    argNames:
    - G
    - nodes
    - alpha
    - beta
    - top_personalization
    - bottom_personalization
    - max_iter
    - tol
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 9
    functionName: networkx.algorithms.bipartite.link_analysis.birank
    functionSourceFile: networkx.algorithms.bipartite.link_analysis
    functionUses: 0
    functionsReached:
    - numpy.ones
    - <builtin>.zip
    - numpy.sqrt
    - <builtin>.map
    - networkx.algorithms.bipartite.link_analysis._clean_personalization_dict
    - <builtin>.any
    - numpy.absolute
    - numpy.array
    - D_u.tocsr
    - <builtin>.len
    - <builtin>.set
    - W.sum
    - itertools.chain
    - D_p.tocsr
    - numpy.linalg.norm
    - scipy.sparse.dia_array
    - networkx.algorithms.bipartite.biadjacency_matrix
    - <builtin>.range
    - numpy.maximum
    - bottom_personalization.get
    - <builtin>.dict
    - personalization.values
    - top_personalization.get
    - personalization.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - personalization
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 309
    functionName: networkx.algorithms.bipartite.link_analysis._clean_personalization_dict
    functionSourceFile: networkx.algorithms.bipartite.link_analysis
    functionUses: 1
    functionsReached:
    - personalization.items
    - personalization.values
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: top_personalization.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: bottom_personalization.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.biadjacency_matrix
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: W.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: D_u.tocsr
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: D_p.tocsr
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.absolute
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: personalization.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: personalization.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.coloring
    functionSourceFile: networkx.algorithms.coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.coloring.equitable_coloring
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: coloring.values
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - F
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 50
    functionName: networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 191
    functionsReached:
    - collections.defaultdict
    - F.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: F.items
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - L
    - C
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 58
    functionName: networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 191
    functionsReached:
    - collections.defaultdict.keys
    - L.keys
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: L.keys
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - C
    - N
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 68
    functionName: networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 191
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 8
    argDefaultValues: []
    argNames:
    - u
    - X
    - Y
    - N
    - H
    - F
    - C
    - L
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 74
    functionName: networkx.algorithms.coloring.equitable_coloring.change_color
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 8
    argDefaultValues: []
    argNames:
    - src_color
    - dst_color
    - N
    - H
    - F
    - C
    - T_cal
    - L
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 104
    functionName: networkx.algorithms.coloring.equitable_coloring.move_witnesses
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 192
    functionsReached:
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - num_colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 116
    functionName: networkx.algorithms.coloring.equitable_coloring.pad_graph
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 191
    functionsReached:
    - <builtin>.range
    - G.add_edges_from
    - networkx.complete_graph
    - <builtin>.len
    - networkx.relabel_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.complete_graph
    functionSourceFile: ''
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 23
    IfCount: 13
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba4c0>
    argNames:
    - V_minus
    - V_plus
    - N
    - H
    - F
    - C
    - L
    - excluded_colors
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 141
    functionName: networkx.algorithms.coloring.equitable_coloring.procedure_P
    functionSourceFile: networkx.algorithms.coloring.equitable_coloring
    functionUses: 191
    functionsReached:
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - marked.update
    - I_set.add
    - next_layer.append
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - R_cal.append
    - excluded_colors.union
    - reachable.extend
    - <builtin>.list
    - A_cal.add
    - <builtin>.len
    - I_covered.update
    - <builtin>.set
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - B_cal_prime.add
    - I_covered.add
    - <builtin>.next
    - excluded_colors.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: A_cal.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R_cal.append
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: marked.update
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: reachable.extend
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: excluded_colors.union
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B_cal_prime.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: I_set.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: I_covered.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: I_covered.update
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: excluded_colors.update
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges_seen.add
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.coloring.greedy_coloring
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - networkx.utils.py_random_state
    - networkx.utils.decorators.py_random_state
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 24
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_largest_first
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7344b880d0>
    argNames:
    - G
    - colors
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 35
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_random_sequential
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - seed.shuffle
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 49
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_smallest_last
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - networkx.algorithms.coloring.greedy_coloring.strategy_smallest_last.find_min_degree
    - collections.deque.appendleft
    - <builtin>.min
    - itertools.count
    - G.copy
    - H.remove_node
    - <builtin>.float
    - <builtin>.next
    - H.degree
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 78
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_smallest_last.find_min_degree
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 1
    functionsReached:
    - <builtin>.next
    - itertools.count
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.remove_node
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 106
    functionName: networkx.algorithms.coloring.greedy_coloring._maximal_independent_set
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 1
    functionsReached:
    - <builtin>.set
    - G.subgraph
    - result.add
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: result.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 122
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_independent_set
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - result.add
    - G.subgraph
    - <builtin>.min
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.coloring.greedy_coloring._maximal_independent_set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 146
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential_bfs
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.connected_components
    - <builtin>.sorted
    - seen.add
    - networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - G.subgraph
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - stack.append
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - G.neighbors
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - visited.add
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc98490>
    argNames:
    - G
    - colors
    - traversal
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 172
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 2
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.connected_components
    - <builtin>.sorted
    - seen.add
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - G.subgraph
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - stack.append
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - G.neighbors
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - visited.add
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 159
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential_dfs
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.connected_components
    - <builtin>.sorted
    - seen.add
    - networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - G.subgraph
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - next_parents_children.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - <builtin>.set
    - <builtin>.next
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - stack.append
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - copy.deepcopy.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - copy.deepcopy.predecessors
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - G.neighbors
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - visited.add
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - copy.deepcopy.neighbors
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - colors
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 204
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_saturation_largest_first
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - distinct_colors.items
    - colors.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: distinct_colors.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.coloring.greedy_coloring.strategy_saturation_largest_first.<lambda1>
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached:
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: STRATEGIES.get
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 7
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 442
    functionName: networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 191
    functionsReached:
    - col_used.discard
    - <builtin>.range
    - frontier.append
    - visited.add
    - visited.intersection
    - <builtin>.max
    - itertools.count
    - <builtin>.list
    - <builtin>.len
    - itertools.dropwhile
    - <builtin>.set
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - graph.values
    - <builtin>.next
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - node_id
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 382
    functionName: networkx.algorithms.coloring.greedy_coloring._Node.__init__
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 192
    functionsReached:
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 388
    functionName: networkx.algorithms.coloring.greedy_coloring._Node.__repr__
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - adj_entry
    - color
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 394
    functionName: networkx.algorithms.coloring.greedy_coloring._Node.assign_color
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - adj_entry
    - color
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 401
    functionName: networkx.algorithms.coloring.greedy_coloring._Node.clear_color
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 409
    functionName: networkx.algorithms.coloring.greedy_coloring._Node.iter_neighbors
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - color
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 415
    functionName: networkx.algorithms.coloring.greedy_coloring._Node.iter_neighbors_color
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node_id
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 425
    functionName: networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 432
    functionName: networkx.algorithms.coloring.greedy_coloring._AdjEntry.__repr__
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: col_used.discard
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange.<lambda1>
    functionSourceFile: networkx.algorithms.coloring.greedy_coloring
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: itertools.dropwhile
    functionSourceFile: itertools
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: frontier.append
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: graph.values
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.cluster
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73497a2430>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 99
    functionName: networkx.algorithms.cluster._triangles_and_degree_iter
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 195
    functionsReached:
    - G.adj.items
    - <builtin>.sum
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - collections.Counter.items
    - collections.Counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: later_nbrs.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc060d0>
    - <ast.Constant object at 0x7f734bc06670>
    argNames:
    - G
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 120
    functionName: networkx.algorithms.cluster._weighted_triangles_and_degree_iter
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 2
    functionsReached:
    - networkx.algorithms.cluster._weighted_triangles_and_degree_iter.wt
    - d.get
    - G.adj.items
    - <builtin>.max
    - G.number_of_edges
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - numpy.cbrt
    - <builtin>.float
    - seen.add
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 140
    functionName: networkx.algorithms.cluster._weighted_triangles_and_degree_iter.wt
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.cbrt
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a5b0>
    argNames:
    - G
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 161
    functionName: networkx.algorithms.cluster._directed_triangles_and_degree_iter
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 2
    functionsReached:
    - <builtin>.sum
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc125e0>
    - <ast.Constant object at 0x7f734cc12df0>
    argNames:
    - G
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 195
    functionName: networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 2
    functionsReached:
    - d.get
    - <builtin>.max
    - G.number_of_edges
    - networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter.wt
    - <builtin>.len
    - G.nbunch_iter
    - <builtin>.set
    - numpy.cbrt
    - <builtin>.float
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 213
    functionName: networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter.wt
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_to_id.get
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba610>
    - <ast.Constant object at 0x7f734cbba820>
    - <ast.Constant object at 0x7f734cbba730>
    argNames:
    - G
    - nodes
    - weight
    - count_zeros
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 325
    functionName: networkx.algorithms.cluster.average_clustering
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 0
    functionsReached:
    - networkx.algorithms.cluster.clustering
    - <builtin>.sum
    - G.number_of_edges
    - <builtin>.abs
    - seen.add
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - collections.Counter.items
    - networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter
    - itertools.chain
    - networkx.algorithms.cluster._weighted_triangles_and_degree_iter
    - G.is_directed
    - G.adj.items
    - networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter.wt
    - numpy.cbrt
    - <builtin>.float
    - collections.Counter
    - networkx.algorithms.cluster._directed_triangles_and_degree_iter
    - G.edges
    - networkx.algorithms.cluster._weighted_triangles_and_degree_iter.wt
    - d.get
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - G.nbunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d4b05b0>
    - <ast.Constant object at 0x7f734d4b0610>
    argNames:
    - G
    - nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 385
    functionName: networkx.algorithms.cluster.clustering
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 1
    functionsReached:
    - G.number_of_edges
    - <builtin>.sum
    - seen.add
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - collections.Counter.items
    - networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter
    - itertools.chain
    - networkx.algorithms.cluster._weighted_triangles_and_degree_iter
    - G.is_directed
    - G.adj.items
    - networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter.wt
    - numpy.cbrt
    - <builtin>.float
    - G.edges
    - collections.Counter
    - networkx.algorithms.cluster._directed_triangles_and_degree_iter
    - networkx.algorithms.cluster._weighted_triangles_and_degree_iter.wt
    - d.get
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - G.nbunch_iter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 609
    functionName: networkx.algorithms.cluster.square_clustering.GAdj.__missing__
    functionSourceFile: networkx.algorithms.cluster
    functionUses: 0
    functionsReached:
    - v_neighbors.discard
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v_neighbors.discard
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: two_hop_neighbors.discard
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.similarity
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.utils.decorators.np_random_state
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 13
    argDefaultValues:
    - <ast.Constant object at 0x7f7347d60b20>
    - <ast.Constant object at 0x7f7347d60af0>
    - <ast.Constant object at 0x7f7347d60ac0>
    - <ast.Constant object at 0x7f7347d60a90>
    - <ast.Constant object at 0x7f7347d60a60>
    - <ast.Constant object at 0x7f7347d60a30>
    - <ast.Constant object at 0x7f7347d60a00>
    - <ast.Constant object at 0x7f7347d609d0>
    - <ast.Constant object at 0x7f7347d609a0>
    - <ast.Constant object at 0x7f7347d60970>
    - <ast.Constant object at 0x7f7347d60940>
    argNames:
    - G1
    - G2
    - node_match
    - edge_match
    - node_subst_cost
    - node_del_cost
    - node_ins_cost
    - edge_subst_cost
    - edge_del_cost
    - edge_ins_cost
    - roots
    - upper_bound
    - timeout
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 39
    functionName: networkx.algorithms.similarity.graph_edit_distance
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - scipy.optimize.linear_sum_assignment
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    - <builtin>.zip
    - matched_gh.append
    - pending_g.insert
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.sum
    - matched_uv.append
    - pending_h.insert
    - networkx.algorithms.similarity.optimize_edit_paths.match_edges
    - <builtin>.enumerate
    - networkx.is_directed
    - pending_u.remove
    - pending_v.remove
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    - <builtin>.any
    - other.append
    - <builtin>.int
    - networkx.algorithms.similarity.optimize_edit_paths
    - <builtin>.reversed
    - <builtin>.max
    - numpy.array
    - pending_v.insert
    - pending_u.insert
    - <builtin>.len
    - <builtin>.set
    - pending_v.pop
    - pending_g.pop
    - Ce.C.sum
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - Cv.C.sum
    - matched_uv.pop
    - matched_gh.pop
    - <builtin>.list
    - time.perf_counter
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - <builtin>.float
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops
    - <builtin>.range
    - networkx.algorithms.similarity.optimize_edit_paths.prune
    - <builtin>.min
    - pending_u.pop
    - pending_h.pop
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 14
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 21
    ICount: 4
    IfCount: 14
    argCount: 14
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa87f0>
    - <ast.Constant object at 0x7f734aaa8460>
    - <ast.Constant object at 0x7f734aaa8910>
    - <ast.Constant object at 0x7f734aaa8820>
    - <ast.Constant object at 0x7f734aaa88e0>
    - <ast.Constant object at 0x7f734aaa8a00>
    - <ast.Constant object at 0x7f734aaa8b50>
    - <ast.Constant object at 0x7f734aaa8d30>
    - <ast.Constant object at 0x7f734aaa8880>
    - <ast.Constant object at 0x7f734aaa8610>
    - <ast.Constant object at 0x7f734aaa8040>
    - <ast.Constant object at 0x7f734aaa89d0>
    argNames:
    - G1
    - G2
    - node_match
    - edge_match
    - node_subst_cost
    - node_del_cost
    - node_ins_cost
    - edge_subst_cost
    - edge_del_cost
    - edge_ins_cost
    - upper_bound
    - strictly_decreasing
    - roots
    - timeout
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 540
    functionName: networkx.algorithms.similarity.optimize_edit_paths
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 3
    functionsReached:
    - <builtin>.sorted
    - scipy.optimize.linear_sum_assignment
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    - <builtin>.zip
    - matched_gh.append
    - pending_g.insert
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.sum
    - matched_uv.append
    - pending_h.insert
    - networkx.algorithms.similarity.optimize_edit_paths.match_edges
    - <builtin>.enumerate
    - networkx.is_directed
    - pending_u.remove
    - pending_v.remove
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    - <builtin>.any
    - other.append
    - <builtin>.int
    - <builtin>.reversed
    - <builtin>.max
    - numpy.array
    - pending_v.insert
    - pending_u.insert
    - <builtin>.len
    - <builtin>.set
    - pending_v.pop
    - pending_g.pop
    - Ce.C.sum
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - Cv.C.sum
    - matched_uv.pop
    - matched_gh.pop
    - <builtin>.list
    - time.perf_counter
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - <builtin>.float
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops
    - <builtin>.range
    - networkx.algorithms.similarity.optimize_edit_paths.prune
    - <builtin>.min
    - pending_u.pop
    - pending_h.pop
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 11
    argDefaultValues:
    - <ast.Constant object at 0x7f7342df42e0>
    - <ast.Constant object at 0x7f7342df42b0>
    - <ast.Constant object at 0x7f7342df4280>
    - <ast.Constant object at 0x7f7342df4250>
    - <ast.Constant object at 0x7f7342df4220>
    - <ast.Constant object at 0x7f7342df41f0>
    - <ast.Constant object at 0x7f7342df41c0>
    - <ast.Constant object at 0x7f7342df4190>
    - <ast.Constant object at 0x7f7342df4160>
    argNames:
    - G1
    - G2
    - node_match
    - edge_match
    - node_subst_cost
    - node_del_cost
    - node_ins_cost
    - edge_subst_cost
    - edge_del_cost
    - edge_ins_cost
    - upper_bound
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 211
    functionName: networkx.algorithms.similarity.optimal_edit_paths
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    - scipy.optimize.linear_sum_assignment
    - <builtin>.zip
    - matched_gh.append
    - pending_g.insert
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.sum
    - matched_uv.append
    - pending_h.insert
    - networkx.algorithms.similarity.optimize_edit_paths.match_edges
    - <builtin>.enumerate
    - networkx.is_directed
    - pending_u.remove
    - pending_v.remove
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    - <builtin>.any
    - other.append
    - <builtin>.int
    - networkx.algorithms.similarity.optimize_edit_paths
    - <builtin>.reversed
    - <builtin>.max
    - numpy.array
    - pending_v.insert
    - pending_u.insert
    - paths.append
    - <builtin>.len
    - <builtin>.set
    - pending_v.pop
    - pending_g.pop
    - Ce.C.sum
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - Cv.C.sum
    - matched_uv.pop
    - matched_gh.pop
    - <builtin>.list
    - time.perf_counter
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - <builtin>.float
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops
    - <builtin>.range
    - networkx.algorithms.similarity.optimize_edit_paths.prune
    - <builtin>.min
    - pending_u.pop
    - pending_h.pop
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: paths.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 11
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3880>
    - <ast.Constant object at 0x7f734d3a3100>
    - <ast.Constant object at 0x7f734d3a3700>
    - <ast.Constant object at 0x7f734d3a3670>
    - <ast.Constant object at 0x7f734d3a3c70>
    - <ast.Constant object at 0x7f734d3a3970>
    - <ast.Constant object at 0x7f734d3a39d0>
    - <ast.Constant object at 0x7f734d3a32b0>
    - <ast.Constant object at 0x7f734d3a3340>
    argNames:
    - G1
    - G2
    - node_match
    - edge_match
    - node_subst_cost
    - node_del_cost
    - node_ins_cost
    - edge_subst_cost
    - edge_del_cost
    - edge_ins_cost
    - upper_bound
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 387
    functionName: networkx.algorithms.similarity.optimize_graph_edit_distance
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - scipy.optimize.linear_sum_assignment
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    - <builtin>.zip
    - matched_gh.append
    - pending_g.insert
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.sum
    - matched_uv.append
    - pending_h.insert
    - networkx.algorithms.similarity.optimize_edit_paths.match_edges
    - <builtin>.enumerate
    - networkx.is_directed
    - pending_u.remove
    - pending_v.remove
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    - <builtin>.any
    - other.append
    - <builtin>.int
    - networkx.algorithms.similarity.optimize_edit_paths
    - <builtin>.reversed
    - <builtin>.max
    - numpy.array
    - pending_v.insert
    - pending_u.insert
    - <builtin>.len
    - <builtin>.set
    - pending_v.pop
    - pending_g.pop
    - Ce.C.sum
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - Cv.C.sum
    - matched_uv.pop
    - matched_gh.pop
    - <builtin>.list
    - time.perf_counter
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - <builtin>.float
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops
    - <builtin>.range
    - networkx.algorithms.similarity.optimize_edit_paths.prune
    - <builtin>.min
    - pending_u.pop
    - pending_h.pop
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - C
    - m
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 698
    functionName: networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 8
    functionsReached:
    - scipy.optimize.linear_sum_assignment
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - C
    - i
    - j
    - m
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 717
    functionName: networkx.algorithms.similarity.optimize_edit_paths.extract_C
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 7
    functionsReached:
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - C
    - i
    - j
    - m
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 723
    functionName: networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 7
    functionsReached:
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - ind
    - i
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 729
    functionName: networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 6
    functionsReached:
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd48bb0>
    argNames:
    - u
    - v
    - pending_g
    - pending_h
    - Ce
    - matched_uv
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 736
    functionName: networkx.algorithms.similarity.optimize_edit_paths.match_edges
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 6
    functionsReached:
    - <builtin>.range
    - scipy.optimize.linear_sum_assignment
    - <builtin>.zip
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.len
    - <builtin>.enumerate
    - networkx.is_directed
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - Ce
    - ij
    - m
    - n
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 831
    functionName: networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 6
    functionsReached:
    - <builtin>.range
    - scipy.optimize.linear_sum_assignment
    - <builtin>.zip
    - <builtin>.sum
    - <builtin>.len
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 8
    argDefaultValues: []
    argNames:
    - matched_uv
    - pending_u
    - pending_v
    - Cv
    - pending_g
    - pending_h
    - Ce
    - matched_cost
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 839
    functionName: networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 5
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    - scipy.optimize.linear_sum_assignment
    - <builtin>.zip
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.sum
    - networkx.algorithms.similarity.optimize_edit_paths.match_edges
    - <builtin>.enumerate
    - networkx.is_directed
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    - <builtin>.any
    - other.append
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - time.perf_counter
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - <builtin>.range
    - networkx.algorithms.similarity.optimize_edit_paths.prune
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 0
    IfCount: 6
    argCount: 1
    argDefaultValues: []
    argNames:
    - cost
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1169
    functionName: networkx.algorithms.similarity.optimize_edit_paths.prune
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 6
    functionsReached:
    - time.perf_counter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: other.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops.<lambda1>
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 11
    IfCount: 7
    argCount: 9
    argDefaultValues: []
    argNames:
    - matched_uv
    - pending_u
    - pending_v
    - Cv
    - matched_gh
    - pending_g
    - pending_h
    - Ce
    - matched_cost
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 938
    functionName: networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 4
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce
    - scipy.optimize.linear_sum_assignment
    - <builtin>.zip
    - matched_gh.append
    - pending_g.insert
    - networkx.algorithms.similarity.optimize_edit_paths.extract_C
    - <builtin>.sum
    - matched_uv.append
    - pending_h.insert
    - networkx.algorithms.similarity.optimize_edit_paths.match_edges
    - <builtin>.enumerate
    - networkx.is_directed
    - numpy.empty
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_ind
    - <builtin>.any
    - other.append
    - <builtin>.reversed
    - <builtin>.max
    - pending_v.insert
    - pending_u.insert
    - <builtin>.len
    - <builtin>.set
    - pending_v.pop
    - pending_g.pop
    - networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix
    - matched_uv.pop
    - matched_gh.pop
    - time.perf_counter
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths
    - networkx.algorithms.similarity.optimize_edit_paths.reduce_C
    - networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops
    - <builtin>.range
    - networkx.algorithms.similarity.optimize_edit_paths.prune
    - <builtin>.min
    - pending_u.pop
    - pending_h.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_u.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_v.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matched_uv.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matched_gh.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_g.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_h.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_u.insert
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_v.insert
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matched_uv.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_g.insert
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_h.insert
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: matched_gh.pop
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_u.remove
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pending_v.remove
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Cv.C.sum
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Ce.C.sum
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: time.perf_counter
    functionSourceFile: time
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nodelist.index
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7347d61f10>
    - <ast.Constant object at 0x7f7347d61ee0>
    - <ast.Constant object at 0x7f7347d61eb0>
    - <ast.Constant object at 0x7f7347d61e80>
    - <ast.Constant object at 0x7f7347d61e50>
    argNames:
    - G
    - source
    - target
    - importance_factor
    - max_iterations
    - tolerance
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1402
    functionName: networkx.algorithms.similarity._simrank_similarity_numpy
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 191
    functionsReached:
    - <builtin>.range
    - numpy.array
    - numpy.fill_diagonal
    - <builtin>.len
    - adjacency_matrix.sum
    - numpy.allclose
    - <builtin>.float
    - numpy.eye
    - networkx.to_numpy_array
    - newsim.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.tolist
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7347d437c0>
    - <ast.Constant object at 0x7f7347d43790>
    - <ast.Constant object at 0x7f7347d43760>
    - <ast.Constant object at 0x7f7347d43730>
    - <ast.Constant object at 0x7f7347d43700>
    argNames:
    - G
    - source
    - target
    - importance_factor
    - max_iterations
    - tolerance
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1342
    functionName: networkx.algorithms.similarity._simrank_similarity_python
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - G.is_directed
    - <builtin>.range
    - <builtin>.list
    - nbrs.items
    - <builtin>.len
    - <builtin>.sum
    - <builtin>.all
    - oldsim.items
    - networkx.algorithms.similarity._simrank_similarity_python.avg_sim
    - itertools.product
    - <builtin>.abs
    - networkx.algorithms.similarity._simrank_similarity_python.sim
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - s
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1369
    functionName: networkx.algorithms.similarity._simrank_similarity_python.avg_sim
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1374
    functionName: networkx.algorithms.similarity._simrank_similarity_python.sim
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 1
    functionsReached:
    - <builtin>.sum
    - <builtin>.list
    - <builtin>.len
    - networkx.algorithms.similarity._simrank_similarity_python.avg_sim
    - itertools.product
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: oldsim.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: adjacency_matrix.sum
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: newsim.copy
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.allclose
    functionSourceFile: numpy
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f7348200c10>
    - <ast.Constant object at 0x7f7348200c40>
    - <ast.Constant object at 0x7f7348200c70>
    - <ast.Constant object at 0x7f7348200ca0>
    - <ast.Constant object at 0x7f7348200cd0>
    - <ast.Constant object at 0x7f7348200d00>
    - <ast.Constant object at 0x7f7348200d30>
    - <ast.Constant object at 0x7f7348200d60>
    argNames:
    - G
    - source
    - path_length
    - c
    - delta
    - eps
    - weight
    - remove_isolates
    - k
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1512
    functionName: networkx.algorithms.similarity._prepare_panther_paths
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 2
    functionsReached:
    - numpy.log
    - networkx.isolates
    - networkx.algorithms.similarity.generate_random_paths
    - G.number_of_nodes
    - numpy.sqrt
    - math.comb
    - G.number_of_edges
    - <builtin>.enumerate
    - adj_mat.sum
    - <builtin>.int
    - G.subgraph
    - <builtin>.set
    - networkx.to_numpy_array
    - <builtin>.list
    - <builtin>.isinstance
    - numpy.reciprocal
    - <builtin>.range
    - node_map.index
    - numpy.log2
    - path.append
    - seed.choice
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.comb
    functionSourceFile: math
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.log2
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 5
    IfCount: 6
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7343c84610>
    - <ast.Constant object at 0x7f7343c84640>
    - <ast.Constant object at 0x7f7343c84670>
    - <ast.Constant object at 0x7f7343c846a0>
    argNames:
    - G
    - sample_size
    - path_length
    - index_map
    - weight
    - seed
    - source
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1968
    functionName: networkx.algorithms.similarity.generate_random_paths
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 3
    functionsReached:
    - <builtin>.range
    - node_map.index
    - path.append
    - seed.choice
    - G.number_of_nodes
    - <builtin>.list
    - <builtin>.isinstance
    - adj_mat.sum
    - networkx.to_numpy_array
    - numpy.reciprocal
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 9
    argDefaultValues:
    - <ast.Constant object at 0x7f734820f5e0>
    - <ast.Constant object at 0x7f734820f610>
    - <ast.Constant object at 0x7f734820f640>
    - <ast.Constant object at 0x7f734820f670>
    - <ast.Constant object at 0x7f734820f6a0>
    - <ast.Constant object at 0x7f734820f6d0>
    - <ast.Constant object at 0x7f734820f700>
    argNames:
    - G
    - source
    - k
    - path_length
    - c
    - delta
    - eps
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1630
    functionName: networkx.algorithms.similarity.panther_similarity
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - numpy.argpartition
    - numpy.log
    - networkx.isolates
    - <builtin>.zip
    - networkx.algorithms.similarity.generate_random_paths
    - G.number_of_nodes
    - numpy.sqrt
    - G.number_of_edges
    - numpy.argsort
    - math.comb
    - <builtin>.enumerate
    - top_k_with_val.pop
    - adj_mat.sum
    - G.subgraph
    - <builtin>.int
    - <builtin>.len
    - <builtin>.set
    - networkx.to_numpy_array
    - <builtin>.list
    - <builtin>.isinstance
    - numpy.reciprocal
    - <builtin>.range
    - node_map.index
    - index_map.items
    - numpy.log2
    - path.append
    - seed.choice
    - <builtin>.min
    - <builtin>.dict
    - source_paths.intersection
    - networkx.algorithms.similarity._prepare_panther_paths
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: index_map.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: source_paths.intersection
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.argpartition
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: top_k_with_val.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 10
    argDefaultValues: []
    argNames:
    - G
    - source
    - D
    - k
    - path_length
    - c
    - delta
    - eps
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1768
    functionName: networkx.algorithms.similarity.panther_vector_similarity
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - numpy.log
    - networkx.isolates
    - scipy.spatial.KDTree
    - <builtin>.zip
    - networkx.algorithms.similarity.generate_random_paths
    - G.number_of_nodes
    - index_map_sets.items
    - numpy.sqrt
    - G.number_of_edges
    - math.comb
    - <builtin>.enumerate
    - top_k_with_val.pop
    - adj_mat.sum
    - vi_paths.intersection
    - G.subgraph
    - <builtin>.int
    - <builtin>.len
    - <builtin>.set
    - numpy.sort
    - networkx.to_numpy_array
    - top_k_with_val.items
    - <builtin>.list
    - <builtin>.isinstance
    - numpy.reciprocal
    - <builtin>.range
    - numpy.atleast_1d
    - numpy.maximum
    - numpy.max
    - index_map.items
    - kdtree.query
    - numpy.log2
    - node_map.index
    - path.append
    - similarities.tolist
    - seed.choice
    - <builtin>.min
    - numpy.partition
    - <builtin>.dict
    - networkx.algorithms.similarity._prepare_panther_paths
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: index_map_sets.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vi_paths.intersection
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.partition
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.sort
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.spatial.KDTree
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kdtree.query
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.atleast_1d
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.max
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: similarities.tolist
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: top_k_with_val.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.similarity.panther_vector_similarity.<lambda1>
    functionSourceFile: networkx.algorithms.similarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: adj_mat.sum
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.reciprocal
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_map.index
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.clique
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cand.copy
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.append
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.clique.find_cliques.<lambda1>
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ext_u.pop
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cand.remove
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.clique.find_cliques.<lambda2>
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.pop
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cand_init.copy
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - subg
    - cand
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 405
    functionName: networkx.algorithms.clique.find_cliques_recursive.expand
    functionSourceFile: networkx.algorithms.clique
    functionUses: 191
    functionsReached:
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - cand.remove
    - <builtin>.max
    - Q.pop
    - Q.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.clique.find_cliques_recursive.expand.<lambda1>
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb32760>
    argNames:
    - G
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 424
    functionName: networkx.algorithms.clique.make_max_clique_graph
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - G.__class__
    - attr.copy
    - keydict.get
    - newdict.update
    - Q.pop
    - <builtin>.enumerate
    - keylist.append
    - Q.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - cand.remove
    - networkx.algorithms.clique.find_cliques
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - ext_u.pop
    - networkx.classes.reportviews.NodeView.__iter__
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - cand.copy
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbd77c0>
    - <ast.Constant object at 0x7f734cbd7730>
    - <ast.Constant object at 0x7f734cbd70d0>
    argNames:
    - G
    - fpos
    - create_using
    - name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 472
    functionName: networkx.algorithms.clique.make_clique_bipartite
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - keydict.get
    - newdict.update
    - Q.pop
    - <builtin>.enumerate
    - keylist.append
    - Q.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - cand.remove
    - networkx.algorithms.clique.find_cliques
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.max
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - stack.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - stack.append
    - attr_dict.update
    - ext_u.pop
    - networkx.classes.reportviews.NodeView.__iter__
    - <builtin>.iter
    - networkx.classes.graph.Graph.add_node
    - collections.abc.Mapping.clear
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - cand.copy
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccffb50>
    - <ast.Constant object at 0x7f734ccff7f0>
    argNames:
    - G
    - nodes
    - cliques
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 585
    functionName: networkx.algorithms.clique.number_of_cliques
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - stack.append
    - itertools.chain.from_iterable
    - ext_u.pop
    - cand.remove
    - networkx.algorithms.clique.find_cliques
    - <builtin>.max
    - G.nodes
    - stack.pop
    - <builtin>.sum
    - <builtin>.list
    - <builtin>.len
    - <builtin>.set
    - Q.pop
    - Q.append
    - cand.copy
    - collections.Counter
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 689
    functionName: networkx.algorithms.clique.MaxWeightClique.__init__
    functionSourceFile: networkx.algorithms.clique
    functionUses: 1
    functionsReached:
    - <builtin>.isinstance
    - G.nodes
    linkageType: pythonLinkage
    raised:
    - ValueError
    - KeyError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - C
    - C_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 706
    functionName: networkx.algorithms.clique.MaxWeightClique.update_incumbent_if_improved
    functionSourceFile: networkx.algorithms.clique
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - P
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 715
    functionName: networkx.algorithms.clique.MaxWeightClique.greedily_find_independent_set
    functionSourceFile: networkx.algorithms.clique
    functionUses: 4
    functionsReached:
    - independent_set.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: independent_set.append
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - P
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 726
    functionName: networkx.algorithms.clique.MaxWeightClique.find_branching_nodes
    functionSourceFile: networkx.algorithms.clique
    functionUses: 3
    functionsReached:
    - independent_set.append
    - networkx.algorithms.clique.MaxWeightClique.greedily_find_independent_set
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - C
    - C_weight
    - P
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 742
    functionName: networkx.algorithms.clique.MaxWeightClique.expand
    functionSourceFile: networkx.algorithms.clique
    functionUses: 2
    functionsReached:
    - branching_nodes.pop
    - networkx.algorithms.clique.MaxWeightClique.greedily_find_independent_set
    - networkx.algorithms.clique.MaxWeightClique.expand
    - networkx.algorithms.clique.MaxWeightClique.update_incumbent_if_improved
    - networkx.algorithms.clique.MaxWeightClique.find_branching_nodes
    - independent_set.append
    - <builtin>.min
    - P.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: branching_nodes.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 757
    functionName: networkx.algorithms.clique.MaxWeightClique.find_max_weight_clique
    functionSourceFile: networkx.algorithms.clique
    functionUses: 1
    functionsReached:
    - branching_nodes.pop
    - <builtin>.sorted
    - networkx.algorithms.clique.MaxWeightClique.expand
    - networkx.algorithms.clique.MaxWeightClique.greedily_find_independent_set
    - networkx.algorithms.clique.MaxWeightClique.update_incumbent_if_improved
    - networkx.algorithms.clique.MaxWeightClique.find_branching_nodes
    - independent_set.append
    - <builtin>.min
    - P.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.clique.MaxWeightClique.find_max_weight_clique.<lambda1>
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a478d60>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 767
    functionName: networkx.algorithms.clique.max_weight_clique
    functionSourceFile: networkx.algorithms.clique
    functionUses: 0
    functionsReached:
    - branching_nodes.pop
    - networkx.algorithms.clique.MaxWeightClique.find_max_weight_clique
    - <builtin>.sorted
    - networkx.algorithms.clique.MaxWeightClique.expand
    - networkx.algorithms.clique.MaxWeightClique.greedily_find_independent_set
    - networkx.algorithms.clique.MaxWeightClique.update_incumbent_if_improved
    - networkx.algorithms.clique.MaxWeightClique.find_branching_nodes
    - independent_set.append
    - G.nodes
    - <builtin>.min
    - P.remove
    - <builtin>.isinstance
    - networkx.algorithms.clique.MaxWeightClique.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.voronoi
    functionSourceFile: networkx.algorithms.voronoi
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab16310>
    argNames:
    - G
    - center_nodes
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 10
    functionName: networkx.algorithms.voronoi.voronoi_cells
    functionSourceFile: networkx.algorithms.voronoi
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - networkx.multi_source_dijkstra_path
    - <builtin>.dict
    - networkx.utils.misc.groups
    - <builtin>.set
    - many_to_one.items
    - paths.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.multi_source_dijkstra_path
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: paths.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.minors
    functionSourceFile: networkx.algorithms.minors
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.minors.contraction
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - iterable
    - relation
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 21
    functionName: networkx.algorithms.minors.contraction.equivalence_classes
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 1
    functionsReached:
    - networkx.utils.arbitrary_element
    - <builtin>.iter
    - block.append
    - <builtin>.isinstance
    - <builtin>.next
    - <builtin>.frozenset
    - networkx.utils.misc.arbitrary_element
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: block.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4e80>
    - <ast.Constant object at 0x7f734b5c4280>
    - <ast.Constant object at 0x7f734b5c4700>
    - <ast.Constant object at 0x7f734cf26850>
    - <ast.Constant object at 0x7f734cf26700>
    - <ast.Constant object at 0x7f734cf26ca0>
    argNames:
    - G
    - partition
    - edge_relation
    - node_data
    - edge_data
    - weight
    - relabel
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 100
    functionName: networkx.algorithms.minors.contraction.quotient_graph
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - G.__class__
    - itertools.permutations
    - attr.copy
    - keydict.get
    - newdict.update
    - block.append
    - networkx.algorithms.community.is_partition
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.subgraph
    - ddd.update
    - partition.values
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.minors.contraction._quotient_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - <builtin>.frozenset
    - networkx.algorithms.minors.contraction.equivalence_classes
    - G.get_edge_data
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - <builtin>.callable
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - itertools.product
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXException
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.community.is_partition
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 3
    IfCount: 6
    argCount: 8
    argDefaultValues: []
    argNames:
    - G
    - partition
    - edge_relation
    - node_data
    - edge_data
    - weight
    - relabel
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 347
    functionName: networkx.algorithms.minors.contraction._quotient_graph
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 1
    functionsReached:
    - itertools.chain.from_iterable
    - G.__class__
    - itertools.permutations
    - attr.copy
    - keydict.get
    - newdict.update
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.relabel_nodes
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.frozenset
    - G.get_edge_data
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - itertools.product
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: partition.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - b
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 359
    functionName: networkx.algorithms.minors.contraction._quotient_graph.node_data
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - S.number_of_edges
    - G.subgraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: S.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - c
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 380
    functionName: networkx.algorithms.minors.contraction._quotient_graph.edge_relation
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 0
    functionsReached:
    - itertools.product
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - b
    - c
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 387
    functionName: networkx.algorithms.minors.contraction._quotient_graph.edge_data
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 0
    functionsReached:
    - d.get
    - G.edges
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 3
    IfCount: 9
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbb6760>
    - <ast.Constant object at 0x7f734cbb6d60>
    argNames:
    - G
    - u
    - v
    - self_loops
    - copy
    - store_contraction_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 431
    functionName: networkx.algorithms.minors.contraction.contracted_nodes
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 1
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - G.add_edges_from
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - H.remove_node
    - <builtin>.set
    - H.has_edge
    - itertools.chain
    - <builtin>.hasattr
    - H.is_directed
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - d.copy
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.reportviews.InEdgeView.__init__
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.out_edges
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.freeze
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - H.add_edge
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.super
    - networkx.empty_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.has_edge
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9ca90>
    - <ast.Constant object at 0x7f734cf9c700>
    argNames:
    - G
    - edge
    - self_loops
    - copy
    - store_contraction_as
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 656
    functionName: networkx.algorithms.minors.contraction.contracted_edge
    functionSourceFile: networkx.algorithms.minors.contraction
    functionUses: 0
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.algorithms.minors.contraction.contracted_nodes
    - nbrs.items
    - keydict.items
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - G.add_edges_from
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - H.remove_node
    - <builtin>.set
    - H.has_edge
    - networkx.classes.graph.Graph.has_edge
    - itertools.chain
    - <builtin>.hasattr
    - H.is_directed
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - d.copy
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.digraph.DiGraph.in_edges
    - networkx.classes.reportviews.InEdgeView.__init__
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.out_edges
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.freeze
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - H.add_edge
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - <builtin>.super
    - networkx.empty_graph
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.walks
    functionSourceFile: networkx.algorithms.walks
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.matrix_power
    functionSourceFile: scipy
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.triads
    functionSourceFile: networkx.algorithms.triads
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - v
    - u
    - w
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 117
    functionName: networkx.algorithms.triads._tricode
    functionSourceFile: networkx.algorithms.triads
    functionUses: 191
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: m.update
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: census.values
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 313
    functionName: networkx.algorithms.triads.all_triads
    functionSourceFile: networkx.algorithms.triads
    functionUses: 191
    functionsReached:
    - itertools.combinations
    - G.nodes
    - G.subgraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.broadcasting
    functionSourceFile: networkx.algorithms.broadcasting
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - U
    - v
    - values
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 24
    functionName: networkx.algorithms.broadcasting._get_max_broadcast_value
    functionSourceFile: networkx.algorithms.broadcasting
    functionUses: 192
    functionsReached:
    - <builtin>.sorted
    - <builtin>.max
    - <builtin>.set
    - <builtin>.enumerate
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - v
    - values
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 29
    functionName: networkx.algorithms.broadcasting._get_broadcast_centers
    functionSourceFile: networkx.algorithms.broadcasting
    functionUses: 192
    functionsReached:
    - <builtin>.sorted
    - <builtin>.set
    - <builtin>.enumerate
    - <builtin>.next
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.remove_nodes_from
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values.update
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.neighbors
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: W.remove
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: T.remove_node
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: W.add
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.link_analysis
    functionSourceFile: networkx.algorithms.link_analysis
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.link_analysis.hits_alg
    functionSourceFile: networkx.algorithms.link_analysis.hits_alg
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7342e7c4f0>
    - <ast.Constant object at 0x7f7342e7c4c0>
    - <ast.Constant object at 0x7f7342e7c490>
    - <ast.Constant object at 0x7f7342e7c460>
    argNames:
    - G
    - max_iter
    - tol
    - nstart
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.link_analysis.hits_alg.hits
    functionSourceFile: networkx.algorithms.link_analysis.hits_alg
    functionUses: 0
    functionsReached:
    - h.sum
    - <builtin>.zip
    - nstart.values
    - numpy.array
    - a.sum
    - <builtin>.list
    - <builtin>.len
    - networkx.adjacency_matrix
    - <builtin>.dict
    - vt.flatten
    - <builtin>.map
    - scipy.sparse.linalg.svds
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nstart.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.svds
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vt.flatten
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.sum
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 0
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3130>
    - <ast.Constant object at 0x7f734d3a32b0>
    - <ast.Constant object at 0x7f734d3a39d0>
    - <ast.Constant object at 0x7f734d3a3970>
    argNames:
    - G
    - max_iter
    - tol
    - nstart
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 99
    functionName: networkx.algorithms.link_analysis.hits_alg._hits_python
    functionSourceFile: networkx.algorithms.link_analysis.hits_alg
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - hlast.keys
    - <builtin>.max
    - G.number_of_nodes
    - <builtin>.sum
    - <builtin>.len
    - dict.fromkeys
    - h.values
    - <builtin>.isinstance
    - a.values
    - <builtin>.abs
    linkageType: pythonLinkage
    raised:
    - Exception
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: hlast.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: a.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f910>
    argNames:
    - G
    - normalized
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 150
    functionName: networkx.algorithms.link_analysis.hits_alg._hits_numpy
    functionSourceFile: networkx.algorithms.link_analysis.hits_alg
    functionUses: 0
    functionsReached:
    - numpy.linalg.eig
    - h.sum
    - <builtin>.zip
    - a.sum
    - a.max
    - <builtin>.len
    - <builtin>.dict
    - numpy.argmax
    - <builtin>.map
    - h.max
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.argmax
    functionSourceFile: numpy
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h.max
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: a.max
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8100>
    - <ast.Constant object at 0x7f734aaa8550>
    - <ast.Constant object at 0x7f734aaa82b0>
    - <ast.Constant object at 0x7f734aaa81f0>
    argNames:
    - G
    - max_iter
    - tol
    - nstart
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 234
    functionName: networkx.algorithms.link_analysis.hits_alg._hits_scipy
    functionSourceFile: networkx.algorithms.link_analysis.hits_alg
    functionUses: 0
    functionsReached:
    - numpy.ones
    - numpy.absolute
    - h.sum
    - <builtin>.zip
    - nstart.get
    - numpy.array
    - a.sum
    - <builtin>.list
    - <builtin>.len
    - x.flatten
    - <builtin>.dict
    - x.sum
    - networkx.to_scipy_sparse_array
    - x.max
    - <builtin>.map
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nstart.get
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.sum
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.max
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.flatten
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.link_analysis.pagerank_alg
    functionSourceFile: networkx.algorithms.link_analysis.pagerank_alg
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f7345863a60>
    - <ast.Constant object at 0x7f7345863a30>
    - <ast.Constant object at 0x7f7345863a00>
    - <ast.Constant object at 0x7f73458639d0>
    - <ast.Constant object at 0x7f73458639a0>
    - <ast.Constant object at 0x7f7345863970>
    - <ast.Constant object at 0x7f7345863940>
    argNames:
    - G
    - alpha
    - personalization
    - max_iter
    - tol
    - nstart
    - weight
    - dangling
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 9
    functionName: networkx.algorithms.link_analysis.pagerank_alg.pagerank
    functionSourceFile: networkx.algorithms.link_analysis.pagerank_alg
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - numpy.repeat
    - <builtin>.sum
    - A.sum
    - networkx.to_scipy_sparse_array
    - <builtin>.map
    - personalization.get
    - numpy.absolute
    - numpy.where
    - numpy.array
    - <builtin>.len
    - dangling.get
    - nstart.get
    - <builtin>.list
    - x.sum
    - scipy.sparse.dia_array
    - <builtin>.range
    - <builtin>.dict
    - networkx.algorithms.link_analysis.pagerank_alg._pagerank_scipy
    - p.sum
    - dangling_weights.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc901c0>
    - <ast.Constant object at 0x7f734bc90a60>
    - <ast.Constant object at 0x7f734bc90040>
    - <ast.Constant object at 0x7f734bc90310>
    - <ast.Constant object at 0x7f734bc90b50>
    - <ast.Constant object at 0x7f734bc90970>
    - <ast.Constant object at 0x7f734bc908e0>
    argNames:
    - G
    - alpha
    - personalization
    - max_iter
    - tol
    - nstart
    - weight
    - dangling
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 358
    functionName: networkx.algorithms.link_analysis.pagerank_alg._pagerank_scipy
    functionSourceFile: networkx.algorithms.link_analysis.pagerank_alg
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - numpy.repeat
    - <builtin>.sum
    - A.sum
    - networkx.to_scipy_sparse_array
    - <builtin>.map
    - personalization.get
    - numpy.absolute
    - numpy.where
    - numpy.array
    - <builtin>.len
    - dangling.get
    - nstart.get
    - <builtin>.list
    - x.sum
    - scipy.sparse.dia_array
    - <builtin>.range
    - <builtin>.dict
    - p.sum
    - dangling_weights.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 0
    IfCount: 5
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f7345863370>
    - <ast.Constant object at 0x7f7345863340>
    - <ast.Constant object at 0x7f7345863310>
    - <ast.Constant object at 0x7f73458632e0>
    - <ast.Constant object at 0x7f73458632b0>
    - <ast.Constant object at 0x7f7345863280>
    - <ast.Constant object at 0x7f7345863250>
    argNames:
    - G
    - alpha
    - personalization
    - max_iter
    - tol
    - nstart
    - weight
    - dangling
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 115
    functionName: networkx.algorithms.link_analysis.pagerank_alg._pagerank_python
    functionSourceFile: networkx.algorithms.link_analysis.pagerank_alg
    functionUses: 0
    functionsReached:
    - nstart.items
    - dangling_weights.get
    - <builtin>.sum
    - <builtin>.abs
    - p.get
    - dangling.values
    - dangling.items
    - W.out_degree
    - <builtin>.len
    - nstart.values
    - W.number_of_nodes
    - networkx.stochastic_graph
    - <builtin>.range
    - W.edges
    - personalization.values
    - dict.fromkeys
    - G.to_directed
    - xlast.keys
    - personalization.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G.to_directed
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.stochastic_graph
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: W.number_of_nodes
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nstart.items
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dangling.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dangling.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: W.out_degree
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xlast.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: W.edges
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dangling_weights.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734d7c11f0>
    - <ast.Constant object at 0x7f734cbb6940>
    - <ast.Constant object at 0x7f734cbb6160>
    - <ast.Constant object at 0x7f734cbb6d60>
    - <ast.Constant object at 0x7f734cbb63a0>
    argNames:
    - G
    - alpha
    - personalization
    - nodelist
    - weight
    - dangling
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 176
    functionName: networkx.algorithms.link_analysis.pagerank_alg.google_matrix
    functionSourceFile: networkx.algorithms.link_analysis.pagerank_alg
    functionUses: 1
    functionsReached:
    - dangling.get
    - numpy.where
    - numpy.array
    - numpy.repeat
    - <builtin>.list
    - A.sum
    - <builtin>.len
    - p.sum
    - dangling_weights.sum
    - networkx.to_numpy_array
    - personalization.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: personalization.get
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: p.sum
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dangling.get
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dangling_weights.sum
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e4f0>
    - <ast.Constant object at 0x7f734a65eb50>
    - <ast.Constant object at 0x7f734a65eee0>
    - <ast.Constant object at 0x7f734a65ee50>
    argNames:
    - G
    - alpha
    - personalization
    - weight
    - dangling
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 271
    functionName: networkx.algorithms.link_analysis.pagerank_alg._pagerank_numpy
    functionSourceFile: networkx.algorithms.link_analysis.pagerank_alg
    functionUses: 0
    functionsReached:
    - numpy.linalg.eig
    - largest.sum
    - dangling.get
    - numpy.where
    - <builtin>.zip
    - numpy.array
    - numpy.repeat
    - <builtin>.list
    - networkx.algorithms.link_analysis.pagerank_alg.google_matrix
    - A.sum
    - <builtin>.len
    - <builtin>.dict
    - numpy.argmax
    - <builtin>.map
    - p.sum
    - dangling_weights.sum
    - networkx.to_numpy_array
    - personalization.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: largest.sum
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.distance_measures
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.contracted_edge
    - networkx.utils.not_implemented_for
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 14
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 9
    EdgeCount: 21
    ICount: 2
    IfCount: 14
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7345a870a0>
    - <ast.Constant object at 0x7f7345a87070>
    argNames:
    - G
    - compute
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 22
    functionName: networkx.algorithms.distance_measures._extrema_bounding
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 195
    functionsReached:
    - networkx.shortest_path_length
    - <builtin>.max
    - <builtin>.min
    - dist.values
    - <builtin>.dict
    - <builtin>.len
    - <builtin>.set
    - dict.fromkeys
    - G.degree
    - ruled_out.update
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dist.values
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ruled_out.update
    functionSourceFile: <builtin>
    functionUses: 196
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbd7130>
    - <ast.Constant object at 0x7f734cbd75b0>
    - <ast.Constant object at 0x7f734cbd7400>
    argNames:
    - G
    - v
    - sp
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 247
    functionName: networkx.algorithms.distance_measures.eccentricity
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 195
    functionsReached:
    - networkx.shortest_path_length
    - G.is_directed
    - <builtin>.max
    - G.order
    - <builtin>.len
    - G.nbunch_iter
    - length.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: length.values
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.values
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbfe940>
    argNames:
    - G
    - sp
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 407
    functionName: networkx.algorithms.distance_measures.harmonic_diameter
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - <builtin>.len
    - networkx.single_source_dijkstra_path_length
    - length.values
    - G.order
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e4f0>
    - <ast.Constant object at 0x7f734b66e940>
    - <ast.Constant object at 0x7f734b66e8b0>
    argNames:
    - G
    - e
    - usebounds
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 482
    functionName: networkx.algorithms.distance_measures.periphery
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.shortest_path_length
    - networkx.algorithms.distance_measures.eccentricity
    - <builtin>.max
    - G.order
    - <builtin>.min
    - dist.values
    - <builtin>.len
    - e.values
    - G.nbunch_iter
    - length.values
    - <builtin>.dict
    - <builtin>.set
    - dict.fromkeys
    - G.degree
    - ruled_out.update
    - networkx.algorithms.distance_measures._extrema_bounding
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc906d0>
    - <ast.Constant object at 0x7f734bc90850>
    - <ast.Constant object at 0x7f734bc90c40>
    argNames:
    - G
    - e
    - usebounds
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 554
    functionName: networkx.algorithms.distance_measures.radius
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.shortest_path_length
    - networkx.algorithms.distance_measures.eccentricity
    - <builtin>.max
    - G.order
    - <builtin>.min
    - dist.values
    - <builtin>.len
    - e.values
    - G.nbunch_iter
    - length.values
    - <builtin>.dict
    - <builtin>.set
    - dict.fromkeys
    - G.degree
    - ruled_out.update
    - networkx.algorithms.distance_measures._extrema_bounding
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55730>
    - <ast.Constant object at 0x7f734bb555e0>
    - <ast.Constant object at 0x7f734bb55220>
    argNames:
    - G
    - e
    - usebounds
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 620
    functionName: networkx.algorithms.distance_measures.center
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - dist.values
    - ruled_out.update
    - <builtin>.max
    - <builtin>.len
    - e.values
    - <builtin>.set
    - G.is_directed
    - networkx.shortest_path_length
    - networkx.is_tree
    - G.order
    - networkx.algorithms.tree.center
    - length.values
    - networkx.algorithms.distance_measures._extrema_bounding
    - networkx.algorithms.distance_measures.eccentricity
    - <builtin>.min
    - <builtin>.dict
    - G.nbunch_iter
    - dict.fromkeys
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.center
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 3
    IfCount: 9
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e700>
    - <ast.Constant object at 0x7f734a65edf0>
    - <ast.Constant object at 0x7f734a65e430>
    argNames:
    - G
    - weight
    - attr
    - sp
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 696
    functionName: networkx.algorithms.distance_measures.barycenter
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - G.is_directed
    - networkx.shortest_path_length
    - sp.items
    - networkx.is_tree
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.float
    - networkx.algorithms.tree.centroid
    - dists.values
    - networkx._clear_cache
    - barycenter_vertices.append
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.tree.centroid
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sp.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dists.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: barycenter_vertices.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 1
    IfCount: 9
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbd0970>
    - <ast.Constant object at 0x7f734cbd09a0>
    - <ast.Constant object at 0x7f734d4b0790>
    - <ast.Constant object at 0x7f734d4b03d0>
    argNames:
    - G
    - nodeA
    - nodeB
    - weight
    - invert_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 783
    functionName: networkx.algorithms.distance_measures.resistance_distance
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - numpy.linalg.pinv
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.list
    - <builtin>.len
    - G.copy
    - node_list.index
    - G.is_multigraph
    - Linv.item
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.pinv
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_list.index
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Linv.item
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73491116a0>
    - <ast.Constant object at 0x7f7349111670>
    argNames:
    - G
    - weight
    - invert_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 920
    functionName: networkx.algorithms.distance_measures.effective_graph_resistance
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - G.number_of_nodes
    - networkx.is_connected
    - <builtin>.len
    - G.copy
    - numpy.sum
    - numpy.sort
    - G.is_multigraph
    - networkx.laplacian_spectrum
    - <builtin>.float
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.laplacian_spectrum
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1008
    functionName: networkx.algorithms.distance_measures.kemeny_constant
    functionSourceFile: networkx.algorithms.distance_measures
    functionUses: 0
    functionsReached:
    - scipy.sparse.dia_array
    - numpy.errstate
    - numpy.isinf
    - numpy.sqrt
    - networkx.is_connected
    - A.sum
    - networkx.adjacency_matrix
    - <builtin>.len
    - networkx.is_negatively_weighted
    - numpy.sum
    - numpy.sort
    - H.todense
    - <builtin>.float
    - scipy.linalg.eigvalsh
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_negatively_weighted
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.todense
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.communicability_alg
    functionSourceFile: networkx.algorithms.communicability_alg
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.eigh
    functionSourceFile: numpy
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.exp
    functionSourceFile: numpy
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.graphical
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a220>
    argNames:
    - sequence
    - method
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 18
    functionName: networkx.algorithms.graphical.is_graphical
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi
    - <builtin>.max
    - <builtin>.min
    - <builtin>.list
    - networkx.algorithms.graphical._basic_graphical_tests
    - <builtin>.len
    - networkx.utils.make_list_of_ints
    - networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - deg_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 187
    functionName: networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.max
    - <builtin>.min
    - networkx.algorithms.graphical._basic_graphical_tests
    - <builtin>.len
    - networkx.utils.make_list_of_ints
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - deg_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 97
    functionName: networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.max
    - <builtin>.min
    - networkx.algorithms.graphical._basic_graphical_tests
    - <builtin>.len
    - networkx.utils.make_list_of_ints
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - deg_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.algorithms.graphical._basic_graphical_tests
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 3
    functionsReached:
    - <builtin>.len
    - networkx.utils.make_list_of_ints
    - <builtin>.max
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.make_list_of_ints
    functionSourceFile: ''
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 278
    functionName: networkx.algorithms.graphical.is_multigraphical
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 0
    functionsReached:
    - networkx.utils.make_list_of_ints
    - <builtin>.max
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 329
    functionName: networkx.algorithms.graphical.is_pseudographical
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 0
    functionsReached:
    - networkx.utils.make_list_of_ints
    - <builtin>.min
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 8
    IfCount: 13
    argCount: 2
    argDefaultValues: []
    argNames:
    - in_sequence
    - out_sequence
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 376
    functionName: networkx.algorithms.graphical.is_digraphical
    functionSourceFile: networkx.algorithms.graphical
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - <builtin>.max
    - heapq.heappop
    - zeroheap.append
    - <builtin>.len
    - networkx.utils.make_list_of_ints
    - heapq.heappush
    - heapq.heapify
    - stubheap.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: stubheap.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: zeroheap.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.asteroidal
    functionSourceFile: networkx.algorithms.asteroidal
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.non_edges
    functionSourceFile: ''
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u_neighborhood.union
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.swap
    functionSourceFile: networkx.algorithms.swap
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.utils.not_implemented_for
    - networkx.algorithms.euler.eulerian_path
    - networkx.contracted_edge
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 7
    IfCount: 11
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - nswap
    - max_tries
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 14
    functionName: networkx.algorithms.swap.directed_edge_swap
    functionSourceFile: networkx.algorithms.swap
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.random
    - networkx.utils.cumulative_distribution
    - <builtin>.zip
    - G.add_edge
    - G.out_degree
    - seed.choice
    - bisect.bisect_left
    - <builtin>.list
    - <builtin>.len
    - G.remove_edge
    - networkx.utils.random_sequence.cumulative_distribution
    - cdf.append
    - G.degree
    - networkx.utils.random_sequence.discrete_sequence
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.cumulative_distribution
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 5
    IfCount: 8
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c46d0>
    - <ast.Constant object at 0x7f734b5c42b0>
    - <ast.Constant object at 0x7f734b5c46a0>
    argNames:
    - G
    - nswap
    - max_tries
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 136
    functionName: networkx.algorithms.swap.double_edge_swap
    functionSourceFile: networkx.algorithms.swap
    functionUses: 0
    functionsReached:
    - G.is_directed
    - <builtin>.range
    - seed.random
    - networkx.utils.cumulative_distribution
    - <builtin>.zip
    - G.add_edge
    - seed.choice
    - G.remove_edge
    - bisect.bisect_left
    - <builtin>.list
    - <builtin>.len
    - networkx.utils.random_sequence.cumulative_distribution
    - cdf.append
    - G.degree
    - networkx.utils.random_sequence.discrete_sequence
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 19
    IfCount: 12
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e7d90>
    - <ast.Constant object at 0x7f734b6e7040>
    - <ast.Constant object at 0x7f734b6e72e0>
    argNames:
    - G
    - nswap
    - _window_threshold
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 234
    functionName: networkx.algorithms.swap.connected_double_edge_swap
    functionSourceFile: networkx.algorithms.swap
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.utils.cumulative_distribution
    - swapped.pop
    - networkx.is_connected
    - <builtin>.len
    - G.add_edge
    - G.remove_edge
    - <builtin>.list
    - bisect.bisect_left
    - math.ceil
    - G.neighbors
    - <builtin>.range
    - networkx.has_path
    - seed.choice
    - networkx.utils.random_sequence.cumulative_distribution
    - cdf.append
    - swapped.append
    - G.degree
    - networkx.utils.random_sequence.discrete_sequence
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: swapped.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: swapped.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.sparsifiers
    functionSourceFile: networkx.algorithms.sparsifiers
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 13
    IfCount: 10
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb790>
    - <ast.Constant object at 0x7f734ccfb310>
    argNames:
    - G
    - stretch
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 15
    functionName: networkx.algorithms.sparsifiers.spanner
    functionSourceFile: networkx.algorithms.sparsifiers
    functionUses: 0
    functionsReached:
    - seed.random
    - clustering.items
    - lightest_edge_neighbor.values
    - G.number_of_nodes
    - lightest_edge_weight.keys
    - attr.copy
    - newdict.update
    - keydict.get
    - edges_to_remove.add
    - edges_to_add.add
    - <builtin>.id
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - residual_graph.remove_node
    - networkx.algorithms.sparsifiers._lightest_edge_dicts
    - residual_graph.remove_edges_from
    - <builtin>.list
    - <builtin>.iter
    - networkx.empty_graph
    - G.edges
    - residual_graph.remove_edge
    - sampled_centers.add
    - math.pow
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.sparsifiers._setup_residual_graph
    - <builtin>.min
    - networkx.algorithms.sparsifiers._add_edge_to_spanner
    - G.copy
    - lightest_edge_weight.items
    - networkx.classes.graph.Graph.__iter__
    - clustering.values
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 190
    functionName: networkx.algorithms.sparsifiers._setup_residual_graph
    functionSourceFile: networkx.algorithms.sparsifiers
    functionUses: 1
    functionsReached:
    - <builtin>.id
    - G.copy
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.pow
    functionSourceFile: math
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: clustering.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sampled_centers.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - residual_graph
    - clustering
    - node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 226
    functionName: networkx.algorithms.sparsifiers._lightest_edge_dicts
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lightest_edge_weight.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lightest_edge_neighbor.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges_to_add.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges_to_remove.add
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lightest_edge_weight.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - H
    - residual_graph
    - u
    - v
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 272
    functionName: networkx.algorithms.sparsifiers._add_edge_to_spanner
    functionSourceFile: networkx.algorithms.sparsifiers
    functionUses: 1
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: residual_graph.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: clustering.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: residual_graph.remove_edge
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: residual_graph.remove_node
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.boundary
    functionSourceFile: networkx.algorithms.boundary
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cadb2e0>
    - <ast.Constant object at 0x7f734cadb160>
    - <ast.Constant object at 0x7f734ba80730>
    - <ast.Constant object at 0x7f734ba80190>
    argNames:
    - G
    - nbunch1
    - nbunch2
    - data
    - keys
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 20
    functionName: networkx.algorithms.boundary.edge_boundary
    functionSourceFile: networkx.algorithms.boundary
    functionUses: 0
    functionsReached:
    - <builtin>.set
    - G.is_multigraph
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality
    functionSourceFile: networkx.algorithms.centrality
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.laplacian
    functionSourceFile: networkx.algorithms.centrality.laplacian
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 3
    IfCount: 8
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8790>
    - <ast.Constant object at 0x7f734b6a85b0>
    - <ast.Constant object at 0x7f734b6a8d90>
    - <ast.Constant object at 0x7f734b6a83a0>
    - <ast.Constant object at 0x7f734b6a8970>
    argNames:
    - G
    - normalized
    - nodelist
    - weight
    - walk_type
    - alpha
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.algorithms.centrality.laplacian.laplacian_centrality
    functionSourceFile: networkx.algorithms.centrality.laplacian
    functionUses: 0
    functionsReached:
    - G.is_directed
    - G.size
    - networkx.directed_laplacian_matrix
    - all_but_i.remove
    - networkx.laplacian_matrix
    - <builtin>.list
    - numpy.fill_diagonal
    - <builtin>.len
    - lap_matrix.diagonal
    - G.nbunch_iter
    - <builtin>.set
    - numpy.sum
    - <builtin>.enumerate
    - <builtin>.float
    - <builtin>.abs
    - numpy.arange
    linkageType: pythonLinkage
    raised:
    - ZeroDivisionError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.directed_laplacian_matrix
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: all_but_i.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: lap_matrix.diagonal
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.katz
    functionSourceFile: networkx.algorithms.centrality.katz
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734aaa8610>
    - <ast.Constant object at 0x7f734aaa8760>
    - <ast.Constant object at 0x7f734aaa83d0>
    - <ast.Constant object at 0x7f734aaa8370>
    - <ast.Constant object at 0x7f734aaa8b50>
    - <ast.Constant object at 0x7f734aaa8040>
    - <ast.Constant object at 0x7f734aaa85b0>
    argNames:
    - G
    - alpha
    - beta
    - max_iter
    - tol
    - nstart
    - normalized
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.centrality.katz.katz_centrality
    functionSourceFile: networkx.algorithms.centrality.katz
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - math.hypot
    - G.number_of_nodes
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.set
    - dict.fromkeys
    - <builtin>.float
    - <builtin>.abs
    - x.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.hypot
    functionSourceFile: math
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba340>
    - <ast.Constant object at 0x7f734cbba2b0>
    - <ast.Constant object at 0x7f734cbbaf10>
    - <ast.Constant object at 0x7f734cbbacd0>
    argNames:
    - G
    - alpha
    - beta
    - normalized
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 199
    functionName: networkx.algorithms.centrality.katz.katz_centrality_numpy
    functionSourceFile: networkx.algorithms.centrality.katz
    functionUses: 0
    functionsReached:
    - numpy.ones
    - numpy.linalg.solve
    - numpy.sign
    - beta.keys
    - <builtin>.zip
    - numpy.array
    - <builtin>.list
    - beta.values
    - <builtin>.len
    - networkx.adjacency_matrix
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.sum
    - numpy.eye
    - numpy.linalg.norm
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: beta.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: beta.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.solve
    functionSourceFile: numpy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.sign
    functionSourceFile: numpy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.degree_alg
    functionSourceFile: networkx.algorithms.centrality.degree_alg
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.second_order
    functionSourceFile: networkx.algorithms.centrality.second_order
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448b50>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 43
    functionName: networkx.algorithms.centrality.second_order.second_order_centrality
    functionSourceFile: networkx.algorithms.centrality.second_order
    functionUses: 0
    functionsReached:
    - numpy.ones
    - numpy.linalg.solve
    - <builtin>.zip
    - networkx.classes.reportviews.DiDegreeView.__init__
    - numpy.sqrt
    - keydict.get
    - numpy.empty
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - P.copy
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.centrality.second_order.second_order_centrality._Qj
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - P.sum
    - networkx.to_numpy_array
    - in_deg.values
    - <builtin>.hasattr
    - <builtin>.list
    - in_deg.items
    - <builtin>.iter
    - <builtin>.float
    - numpy.identity
    - <builtin>.range
    - d.get
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.dict
    - numpy.sum
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_deg.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: in_deg.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - P
    - j
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 124
    functionName: networkx.algorithms.centrality.second_order.second_order_centrality._Qj
    functionSourceFile: networkx.algorithms.centrality.second_order
    functionUses: 1
    functionsReached:
    - P.copy
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.copy
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.group
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 18
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 10
    EdgeCount: 26
    ICount: 2
    IfCount: 18
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7347f402b0>
    - <ast.Constant object at 0x7f7347f40280>
    - <ast.Constant object at 0x7f7347f40250>
    argNames:
    - G
    - C
    - normalized
    - weight
    - endpoints
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 24
    functionName: networkx.algorithms.centrality.group.group_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 0
    functionsReached:
    - networkx.algorithms.centrality.betweenness._accumulate_endpoints
    - S.pop
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - networkx.is_strongly_connected
    - networkx.is_directed
    - S.append
    - <builtin>.any
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.centrality.group._group_preprocessing
    - <builtin>.set
    - <builtin>.next
    - GBC.append
    - G.is_directed
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - itertools.count
    - <builtin>.iter
    - <builtin>.callable
    - heapq.heappush
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 0
    IfCount: 6
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - set_v
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 201
    functionName: networkx.algorithms.centrality.group._group_preprocessing
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 2
    functionsReached:
    - networkx.algorithms.centrality.betweenness._accumulate_endpoints
    - S.pop
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.len
    - <builtin>.next
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - itertools.count
    - <builtin>.iter
    - <builtin>.callable
    - heapq.heappush
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: GBC.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - s
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 397
    functionName: networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 8
    functionsReached:
    - collections.deque.append
    - <builtin>.iter
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - S.append
    - collections.deque
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - s
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 422
    functionName: networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 8
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - itertools.count
    - <builtin>.callable
    - heapq.heappush
    - dict.fromkeys
    - <builtin>.next
    - S.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - betweenness
    - S
    - P
    - sigma
    - s
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 468
    functionName: networkx.algorithms.centrality.betweenness._accumulate_endpoints
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 4
    functionsReached:
    - <builtin>.len
    - S.pop
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 2
    IfCount: 12
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734ab162e0>
    - <ast.Constant object at 0x7f734ab16eb0>
    - <ast.Constant object at 0x7f734ab16880>
    - <ast.Constant object at 0x7f734ab16ee0>
    - <ast.Constant object at 0x7f734ab165e0>
    argNames:
    - G
    - k
    - weight
    - C
    - endpoints
    - normalized
    - greedy
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 241
    functionName: networkx.algorithms.centrality.group.prominent_group
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.algorithms.centrality.betweenness._accumulate_endpoints
    - <builtin>.zip
    - S.pop
    - heapq.heappop
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - networkx.is_strongly_connected
    - attr.copy
    - newdict.update
    - networkx.is_directed
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - numpy.diag
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.is_connected
    - <builtin>.len
    - networkx.algorithms.centrality.group._group_preprocessing
    - <builtin>.set
    - <builtin>.next
    - G.is_directed
    - attr_dict.update
    - pandas.DataFrame.from_dict
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - <builtin>.list
    - itertools.count
    - <builtin>.iter
    - <builtin>.callable
    - heapq.heappush
    - betweenness.drop
    - <builtin>.float
    - collections.deque
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - networkx.classes.graph.Graph.number_of_nodes
    - <builtin>.dict
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - dict.fromkeys
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.centrality.group._heuristic
    - networkx.algorithms.centrality.group._dfbnb
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pandas.DataFrame.from_dict
    functionSourceFile: pandas
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: betweenness.drop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 0
    IfCount: 4
    argCount: 9
    argDefaultValues: []
    argNames:
    - G
    - k
    - DF_tree
    - max_GBC
    - root
    - D
    - max_group
    - nodes
    - greedy
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 416
    functionName: networkx.algorithms.centrality.group._dfbnb
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.sorted
    - numpy.diag
    - networkx.classes.graph.Graph.number_of_nodes
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - attr.copy
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.dict
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.centrality.group._heuristic
    - networkx._clear_cache
    - networkx.algorithms.centrality.group._dfbnb
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 6
    argDefaultValues: []
    argNames:
    - k
    - root
    - DF_tree
    - D
    - nodes
    - greedy
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 460
    functionName: networkx.algorithms.centrality.group._heuristic
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 2
    functionsReached:
    - <builtin>.range
    - <builtin>.sorted
    - networkx.classes.graph.Graph.number_of_nodes
    - numpy.diag
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - attr.copy
    - <builtin>.iter
    - <builtin>.dict
    - <builtin>.len
    - newdict.update
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7342df5f70>
    argNames:
    - G
    - S
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 549
    functionName: networkx.algorithms.centrality.group.group_closeness_centrality
    functionSourceFile: networkx.algorithms.centrality.group
    functionUses: 0
    functionsReached:
    - G.is_directed
    - G.reverse
    - <builtin>.len
    - networkx.multi_source_dijkstra_path_length
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.multi_source_dijkstra_path_length
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.betweenness
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55250>
    - <ast.Constant object at 0x7f734bb556a0>
    - <ast.Constant object at 0x7f734bb55850>
    - <ast.Constant object at 0x7f734bb55610>
    - <ast.Constant object at 0x7f734bb55700>
    argNames:
    - G
    - k
    - normalized
    - weight
    - endpoints
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 18
    functionName: networkx.algorithms.centrality.betweenness.betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 0
    functionsReached:
    - networkx.algorithms.centrality.betweenness._accumulate_endpoints
    - S.pop
    - seed.sample
    - networkx.algorithms.centrality.betweenness._accumulate_basic
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - G.is_directed
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - <builtin>.list
    - itertools.count
    - <builtin>.iter
    - <builtin>.callable
    - heapq.heappush
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - G.nodes
    - collections.deque.popleft
    - networkx.algorithms.centrality.betweenness._rescale
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - betweenness
    - S
    - P
    - sigma
    - s
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 456
    functionName: networkx.algorithms.centrality.betweenness._accumulate_basic
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 1
    functionsReached:
    - S.pop
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 0
    IfCount: 6
    argCount: 6
    argDefaultValues: []
    argNames:
    - betweenness
    - n
    - normalized
    - directed
    - endpoints
    - sampled_nodes
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 498
    functionName: networkx.algorithms.centrality.betweenness._rescale
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 4
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a33d0>
    - <ast.Constant object at 0x7f734d3a3a60>
    - <ast.Constant object at 0x7f734d3a3d60>
    - <ast.Constant object at 0x7f734d3a3bb0>
    argNames:
    - G
    - k
    - normalized
    - weight
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 246
    functionName: networkx.algorithms.centrality.betweenness.edge_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 0
    functionsReached:
    - heapq.heappop
    - seed.sample
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - S.pop
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - G.is_directed
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - <builtin>.list
    - itertools.count
    - <builtin>.iter
    - G.is_multigraph
    - <builtin>.callable
    - heapq.heappush
    - G.edges
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - G.nodes
    - betweenness.update
    - networkx.algorithms.centrality.betweenness._accumulate_edges
    - collections.deque.popleft
    - networkx.algorithms.centrality.betweenness._rescale
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - networkx.algorithms.centrality.betweenness._add_edge_keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: betweenness.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - betweenness
    - S
    - P
    - sigma
    - s
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 481
    functionName: networkx.algorithms.centrality.betweenness._accumulate_edges
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 1
    functionsReached:
    - S.pop
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe8340>
    argNames:
    - G
    - betweenness
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 559
    functionName: networkx.algorithms.centrality.betweenness._add_edge_keys
    functionSourceFile: networkx.algorithms.centrality.betweenness
    functionUses: 2
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.len
    - <builtin>.callable
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: S.append
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: S.pop
    functionSourceFile: <builtin>
    functionUses: 14
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths
    functionSourceFile: networkx.algorithms.shortest_paths
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.dense
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4760>
    - <ast.Constant object at 0x7f734b5c41c0>
    argNames:
    - G
    - nodelist
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 14
    functionName: networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - numpy.fill_diagonal
    - <builtin>.len
    - <builtin>.set
    - numpy.minimum
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b3c6550>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 90
    functionName: networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - G.is_directed
    - d.get
    - <builtin>.min
    - <builtin>.dict
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.<lambda1>
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.<lambda1>.<lambda1>
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 0
    functionsReached:
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - source
    - target
    - predecessors
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 173
    functionName: networkx.algorithms.shortest_paths.dense.reconstruct_path
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 0
    functionsReached:
    - <builtin>.reversed
    - path.append
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26c40>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 217
    functionName: networkx.algorithms.shortest_paths.dense.floyd_warshall
    functionSourceFile: networkx.algorithms.shortest_paths.dense
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - G.is_directed
    - d.get
    - <builtin>.min
    - networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance
    - <builtin>.dict
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.astar
    functionSourceFile: networkx.algorithms.shortest_paths.astar
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 4
    IfCount: 11
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41ee0>
    - <ast.Constant object at 0x7f734cd410a0>
    argNames:
    - G
    - source
    - target
    - heuristic
    - weight
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 13
    functionName: networkx.algorithms.shortest_paths.astar.astar_path
    functionSourceFile: networkx.algorithms.shortest_paths.astar
    functionUses: 1
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - path.append
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - itertools.count
    - path.reverse
    - <builtin>.callable
    - heapq.heappush
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 102
    functionName: networkx.algorithms.shortest_paths.astar.astar_path.heuristic
    functionSourceFile: networkx.algorithms.shortest_paths.astar
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3700>
    - <ast.Constant object at 0x7f734d3a3490>
    argNames:
    - G
    - source
    - target
    - heuristic
    - weight
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 175
    functionName: networkx.algorithms.shortest_paths.astar.astar_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.astar
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.shortest_paths.astar.astar_path
    - <builtin>.zip
    - path.append
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - <builtin>.sum
    - itertools.count
    - path.reverse
    - <builtin>.callable
    - heapq.heappush
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.shortest_paths.unweighted
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - adj
    - firstlevel
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 200
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    - seen.add
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 3
    IfCount: 7
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - source
    - target
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 292
    functionName: networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 191
    functionsReached:
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - reverse_fringe.append
    - forward_fringe.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - adj
    - firstlevel
    - paths
    - cutoff
    - join
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 398
    functionName: networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 193
    functionsReached:
    - <builtin>.len
    - nextlevel.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - p1
    - p2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 481
    functionName: networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.join
    functionSourceFile: networkx.algorithms.shortest_paths.unweighted
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.trophic
    functionSourceFile: networkx.algorithms.centrality.trophic
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbf2100>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.algorithms.centrality.trophic.trophic_levels
    functionSourceFile: networkx.algorithms.centrality.trophic
    functionUses: 2
    functionsReached:
    - numpy.linalg.inv
    - n.sum
    - y.item
    - <builtin>.len
    - networkx.adjacency_matrix
    - numpy.sum
    - <builtin>.enumerate
    - networkx.bfs_layers
    - numpy.eye
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.inv
    functionSourceFile: numpy
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: n.sum
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: y.item
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a5bb8b0>
    argNames:
    - G
    - weight
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 105
    functionName: networkx.algorithms.centrality.trophic.trophic_differences
    functionSourceFile: networkx.algorithms.centrality.trophic
    functionUses: 1
    functionsReached:
    - numpy.linalg.inv
    - n.sum
    - networkx.algorithms.centrality.trophic.trophic_levels
    - y.item
    - networkx.adjacency_matrix
    - <builtin>.len
    - numpy.sum
    - <builtin>.enumerate
    - networkx.bfs_layers
    - numpy.eye
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90580>
    - <ast.Constant object at 0x7f734bc90190>
    argNames:
    - G
    - weight
    - cannibalism
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 140
    functionName: networkx.algorithms.centrality.trophic.trophic_incoherence_parameter
    functionSourceFile: networkx.algorithms.centrality.trophic
    functionUses: 0
    functionsReached:
    - networkx.algorithms.centrality.trophic.trophic_differences
    - numpy.linalg.inv
    - networkx.selfloop_edges
    - networkx.algorithms.centrality.trophic.trophic_levels
    - n.sum
    - <builtin>.list
    - y.item
    - <builtin>.len
    - G.copy
    - numpy.std
    - G_2.remove_edges_from
    - networkx.adjacency_matrix
    - numpy.sum
    - <builtin>.float
    - diffs.values
    - numpy.eye
    - networkx.bfs_layers
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_2.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: diffs.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.std
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.voterank_alg
    functionSourceFile: networkx.algorithms.centrality.voterank_alg
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.voterank_alg.voterank.<lambda1>
    functionSourceFile: networkx.algorithms.centrality.voterank_alg
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: influential_nodes.append
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.load
    functionSourceFile: networkx.algorithms.centrality.load
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65edc0>
    - <ast.Constant object at 0x7f734a65ed90>
    - <ast.Constant object at 0x7f734a65e940>
    - <ast.Constant object at 0x7f734a65e280>
    argNames:
    - G
    - v
    - cutoff
    - normalized
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 11
    functionName: networkx.algorithms.centrality.load.newman_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.load
    functionUses: 0
    functionsReached:
    - length.items
    - networkx.algorithms.centrality.load._node_betweenness
    - G.order
    - onodes.pop
    - networkx.dijkstra_predecessor_and_distance
    - <builtin>.len
    - onodes.sort
    - networkx.predecessor
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c41f0>
    - <ast.Constant object at 0x7f734b5c4cd0>
    - <ast.Constant object at 0x7f734b5c4d60>
    argNames:
    - G
    - source
    - cutoff
    - normalized
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 86
    functionName: networkx.algorithms.centrality.load._node_betweenness
    functionSourceFile: networkx.algorithms.centrality.load
    functionUses: 1
    functionsReached:
    - length.items
    - onodes.pop
    - networkx.dijkstra_predecessor_and_distance
    - <builtin>.len
    - onodes.sort
    - networkx.predecessor
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: length.items
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: onodes.sort
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: onodes.pop
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe84f0>
    - <ast.Constant object at 0x7f734cbe8730>
    argNames:
    - G
    - source
    - nodes
    - cutoff
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 176
    functionName: networkx.algorithms.centrality.load._edge_betweenness
    functionSourceFile: networkx.algorithms.centrality.load
    functionUses: 191
    functionsReached:
    - <builtin>.sorted
    - length.items
    - onodes.pop
    - operator.itemgetter
    - <builtin>.len
    - networkx.predecessor
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ubetween.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.closeness
    functionSourceFile: networkx.algorithms.centrality.closeness
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc5be80>
    - <ast.Constant object at 0x7f734cc5b6a0>
    - <ast.Constant object at 0x7f734cc5b7f0>
    argNames:
    - G
    - u
    - distance
    - wf_improved
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 15
    functionName: networkx.algorithms.centrality.closeness.closeness_centrality
    functionSourceFile: networkx.algorithms.centrality.closeness
    functionUses: 0
    functionsReached:
    - G.is_directed
    - G.reverse
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.float
    - seen.add
    - sp.values
    - nextlevel.append
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90a30>
    - <ast.Constant object at 0x7f734bc90a00>
    - <ast.Constant object at 0x7f734bc90490>
    argNames:
    - G
    - edge
    - prev_cc
    - insertion
    - wf_improved
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 142
    functionName: networkx.algorithms.centrality.closeness.incremental_closeness_centrality
    functionSourceFile: networkx.algorithms.centrality.closeness
    functionUses: 0
    functionsReached:
    - prev_cc.keys
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - networkx.closeness_centrality
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - G.add_edge
    - G.nodes
    - G.remove_edge
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.dict
    - <builtin>.set
    - <builtin>.float
    - <builtin>.abs
    - seen.add
    - sp.values
    - nextlevel.append
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: prev_cc.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.closeness_centrality
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.eigenvector
    functionSourceFile: networkx.algorithms.centrality.eigenvector
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb321f0>
    - <ast.Constant object at 0x7f734cb329d0>
    - <ast.Constant object at 0x7f734cb32760>
    - <ast.Constant object at 0x7f734cb32550>
    argNames:
    - G
    - max_iter
    - tol
    - nstart
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 13
    functionName: networkx.algorithms.centrality.eigenvector.eigenvector_centrality
    functionSourceFile: networkx.algorithms.centrality.eigenvector
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - nstart.items
    - math.hypot
    - xlast.copy
    - G.number_of_nodes
    - <builtin>.sum
    - <builtin>.len
    - x.items
    - <builtin>.all
    - x.values
    - nstart.values
    - <builtin>.abs
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: xlast.copy
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: x.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4dc0>
    - <ast.Constant object at 0x7f734b5c4370>
    - <ast.Constant object at 0x7f734b5c4b20>
    argNames:
    - G
    - weight
    - max_iter
    - tol
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 198
    functionName: networkx.algorithms.centrality.eigenvector.eigenvector_centrality_numpy
    functionSourceFile: networkx.algorithms.centrality.eigenvector
    functionUses: 0
    functionsReached:
    - G.is_directed
    - largest.sum
    - numpy.sign
    - <builtin>.zip
    - scipy.sparse.linalg.eigs
    - scipy.linalg.norm
    - networkx.is_connected
    - <builtin>.list
    - networkx.is_strongly_connected
    - <builtin>.len
    - <builtin>.dict
    - networkx.to_scipy_sparse_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.linalg.norm
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.percolation
    functionSourceFile: networkx.algorithms.centrality.percolation
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b1013a0>
    - <ast.Constant object at 0x7f734b101220>
    - <ast.Constant object at 0x7f734b101d90>
    argNames:
    - G
    - attribute
    - states
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 15
    functionName: networkx.algorithms.centrality.percolation.percolation_centrality
    functionSourceFile: networkx.algorithms.centrality.percolation
    functionUses: 0
    functionsReached:
    - heapq.heappop
    - S.pop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.get_node_attributes
    - states.values
    - <builtin>.len
    - <builtin>.next
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - itertools.count
    - <builtin>.iter
    - networkx.algorithms.centrality.percolation._accumulate_percolation
    - <builtin>.callable
    - heapq.heappush
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - collections.deque.popleft
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: states.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 7
    argDefaultValues: []
    argNames:
    - percolation
    - S
    - P
    - sigma
    - s
    - states
    - p_sigma_x_t
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 117
    functionName: networkx.algorithms.centrality.percolation._accumulate_percolation
    functionSourceFile: networkx.algorithms.centrality.percolation
    functionUses: 1
    functionsReached:
    - S.pop
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.dispersion
    functionSourceFile: networkx.algorithms.centrality.dispersion
    functionUses: 0
    functionsReached:
    - networkx.utils.backends._dispatchable
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - G_u
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 57
    functionName: networkx.algorithms.centrality.dispersion.dispersion._dispersion
    functionSourceFile: networkx.algorithms.centrality.dispersion
    functionUses: 191
    functionsReached:
    - <builtin>.len
    - itertools.combinations
    - <builtin>.set
    - nbrs_s.isdisjoint
    - u_nbrs.intersection
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u_nbrs.intersection
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbrs_s.isdisjoint
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.current_flow_closeness
    functionSourceFile: networkx.algorithms.centrality.current_flow_closeness
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc98250>
    - <ast.Name object at 0x7f734cc98400>
    - <ast.Constant object at 0x7f734cc989a0>
    argNames:
    - G
    - weight
    - dtype
    - solver
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 16
    functionName: networkx.algorithms.centrality.current_flow_closeness.current_flow_closeness_centrality
    functionSourceFile: networkx.algorithms.centrality.current_flow_closeness
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.factorized
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - networkx.utils.rcm.pseudo_peripheral_node
    - <builtin>.zip
    - v.min
    - G.number_of_nodes
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - <builtin>.enumerate
    - C2.get_row
    - v.max
    - visited.update
    - np.nonzero
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - betweenness.items
    - networkx.shortest_path_length
    - col.item
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - np.linalg.inv
    - spl.values
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - collections.deque
    - networkx.utils.misc.arbitrary_element
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - <builtin>.dict
    - collections.deque.popleft
    - dict.fromkeys
    - L.astype
    - G.degree
    - H.number_of_nodes
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: L.astype
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734ceff760>
    - <ast.Constant object at 0x7f734ceff400>
    argNames:
    - self
    - L
    - width
    - dtype
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 37
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 7
    functionsReached:
    - scipy.sparse.linalg.factorized
    - np.nonzero
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - <builtin>.max
    - v.min
    - <builtin>.len
    - <builtin>.enumerate
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - np.linalg.inv
    - v.max
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C2.get_row
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: col.item
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: betweenness.items
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.flow_matrix
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a9ed4c0>
    - <ast.Name object at 0x7f734a9ed640>
    - <ast.Constant object at 0x7f734a9edbe0>
    argNames:
    - G
    - weight
    - dtype
    - solver
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 7
    functionName: networkx.algorithms.centrality.flow_matrix.flow_matrix_row
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 4
    functionsReached:
    - scipy.sparse.linalg.factorized
    - <builtin>.sorted
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - v.min
    - G.number_of_nodes
    - <builtin>.enumerate
    - v.max
    - C.get_rows
    - np.nonzero
    - <builtin>.max
    - networkx.laplacian_matrix
    - <builtin>.len
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - np.linalg.inv
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - G.edges
    - <builtin>.range
    - L.astype
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.get_rows
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - L
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 70
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 8
    functionsReached:
    - np.nonzero
    - <builtin>.max
    - v.min
    - <builtin>.len
    - <builtin>.enumerate
    - v.max
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - L
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 8
    functionsReached:
    - np.linalg.inv
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - L
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 97
    functionName: networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 8
    functionsReached:
    - scipy.sparse.linalg.factorized
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - L
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 52
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.init_solver
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 55
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.solve
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 58
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.solve_inverse
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - r1
    - r2
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 61
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.get_rows
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.solve_inverse
    - <builtin>.range
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.solve_inverse
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 102
    functionName: networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.solve_inverse
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 2
    functionsReached:
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 92
    functionName: networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.solve_inverse
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 66
    functionName: networkx.algorithms.centrality.flow_matrix.InverseLaplacian.get_row
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.solve_inverse
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.solve_inverse
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.nonzero
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v.max
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: v.min
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.zeros
    functionSourceFile: <builtin>
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: np.linalg.inv
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - rhs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 87
    functionName: networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.solve
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.factorized
    functionSourceFile: scipy
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - rhs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 107
    functionName: networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.solve
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - L
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 114
    functionName: networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian.init_solver
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.spilu
    - scipy.sparse.linalg.LinearOperator
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.spilu
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.sparse.linalg.LinearOperator
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - rhs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 122
    functionName: networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian.solve
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - sp.sparse.linalg.cg
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sp.sparse.linalg.cg
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 127
    functionName: networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian.solve_inverse
    functionSourceFile: networkx.algorithms.centrality.flow_matrix
    functionUses: 0
    functionsReached:
    - sp.sparse.linalg.cg
    - np.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.subgraph_alg
    functionSourceFile: networkx.algorithms.centrality.subgraph_alg
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: values.max
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.nonzero
    functionSourceFile: numpy
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: w.max
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: B.sum
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cbc.items
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.betweenness_subset
    functionSourceFile: networkx.algorithms.centrality.betweenness_subset
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf83190>
    - <ast.Constant object at 0x7f734cf83a30>
    argNames:
    - G
    - sources
    - targets
    - normalized
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 22
    functionName: networkx.algorithms.centrality.betweenness_subset.betweenness_centrality_subset
    functionSourceFile: networkx.algorithms.centrality.betweenness_subset
    functionUses: 0
    functionsReached:
    - S.pop
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.centrality.betweenness_subset._accumulate_subset
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - G.is_directed
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - itertools.count
    - <builtin>.iter
    - <builtin>.callable
    - heapq.heappush
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - collections.deque.popleft
    - networkx.algorithms.centrality.betweenness._rescale
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 6
    argDefaultValues: []
    argNames:
    - betweenness
    - S
    - P
    - sigma
    - s
    - targets
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 202
    functionName: networkx.algorithms.centrality.betweenness_subset._accumulate_subset
    functionSourceFile: networkx.algorithms.centrality.betweenness_subset
    functionUses: 1
    functionsReached:
    - <builtin>.set
    - S.pop
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd6c6a0>
    - <ast.Constant object at 0x7f734cd6cca0>
    argNames:
    - G
    - sources
    - targets
    - normalized
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 116
    functionName: networkx.algorithms.centrality.betweenness_subset.edge_betweenness_centrality_subset
    functionSourceFile: networkx.algorithms.centrality.betweenness_subset
    functionUses: 0
    functionsReached:
    - S.pop
    - heapq.heappop
    - networkx.algorithms.shortest_paths.weighted._weight_function
    - S.append
    - collections.deque.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.algorithms.centrality.betweenness_subset._accumulate_edges_subset
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - b.update
    - G.is_directed
    - networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic
    - itertools.count
    - <builtin>.iter
    - G.is_multigraph
    - <builtin>.callable
    - heapq.heappush
    - G.edges
    - collections.deque
    - networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic
    - collections.deque.popleft
    - networkx.algorithms.centrality.betweenness._rescale
    - networkx.classes.graph.Graph.__iter__
    - dict.fromkeys
    - networkx.algorithms.centrality.betweenness._add_edge_keys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 6
    argDefaultValues: []
    argNames:
    - betweenness
    - S
    - P
    - sigma
    - s
    - targets
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 218
    functionName: networkx.algorithms.centrality.betweenness_subset._accumulate_edges_subset
    functionSourceFile: networkx.algorithms.centrality.betweenness_subset
    functionUses: 1
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    - S.pop
    - dict.fromkeys
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.current_flow_betweenness_subset
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness_subset
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba44670>
    - <ast.Constant object at 0x7f734cb325b0>
    - <ast.Name object at 0x7f734cb32460>
    - <ast.Constant object at 0x7f734cb320d0>
    argNames:
    - G
    - sources
    - targets
    - normalized
    - weight
    - dtype
    - solver
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 15
    functionName: networkx.algorithms.centrality.current_flow_betweenness_subset.current_flow_betweenness_centrality_subset
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness_subset
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.factorized
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - networkx.utils.rcm.pseudo_peripheral_node
    - <builtin>.zip
    - v.min
    - G.number_of_nodes
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - <builtin>.enumerate
    - <builtin>.abs
    - v.max
    - C.get_rows
    - visited.update
    - np.nonzero
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - networkx.algorithms.centrality.flow_matrix.flow_matrix_row
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - betweenness.items
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - np.linalg.inv
    - spl.values
    - row.item
    - collections.deque
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - <builtin>.dict
    - collections.deque.popleft
    - dict.fromkeys
    - L.astype
    - G.degree
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: row.item
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3490>
    - <ast.Constant object at 0x7f734d3a37f0>
    - <ast.Name object at 0x7f734d3a30d0>
    - <ast.Constant object at 0x7f734d3a34f0>
    argNames:
    - G
    - sources
    - targets
    - normalized
    - weight
    - dtype
    - solver
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 125
    functionName: networkx.algorithms.centrality.current_flow_betweenness_subset.edge_current_flow_betweenness_centrality_subset
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness_subset
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.factorized
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - networkx.utils.rcm.pseudo_peripheral_node
    - <builtin>.zip
    - v.min
    - G.number_of_nodes
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - <builtin>.enumerate
    - <builtin>.abs
    - v.max
    - H.edges
    - visited.update
    - C.get_rows
    - np.nonzero
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - networkx.algorithms.centrality.flow_matrix.flow_matrix_row
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - betweenness.items
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.tuple
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - np.linalg.inv
    - spl.values
    - row.item
    - G.edges
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - <builtin>.dict
    - collections.deque.popleft
    - dict.fromkeys
    - L.astype
    - G.degree
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.harmonic
    functionSourceFile: networkx.algorithms.centrality.harmonic
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41670>
    - <ast.Constant object at 0x7f734cd41520>
    - <ast.Constant object at 0x7f734cd418e0>
    argNames:
    - G
    - nbunch
    - distance
    - sources
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 11
    functionName: networkx.algorithms.centrality.harmonic.harmonic_centrality
    functionSourceFile: networkx.algorithms.centrality.harmonic
    functionUses: 0
    functionsReached:
    - dist.items
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.reverse
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.is_directed
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dist.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.reaching
    functionSourceFile: networkx.algorithms.centrality.reaching
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e75b0>
    argNames:
    - G
    - path
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 9
    functionName: networkx.algorithms.centrality.reaching._average_weight
    functionSourceFile: networkx.algorithms.centrality.reaching
    functionUses: 2
    functionsReached:
    - itertools.pairwise
    - <builtin>.zip
    - <builtin>.sum
    - <builtin>.len
    - itertools.tee
    - <builtin>.next
    - networkx.utils.misc.pairwise
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64b580>
    - <ast.Constant object at 0x7f734d64b2b0>
    argNames:
    - G
    - weight
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 35
    functionName: networkx.algorithms.centrality.reaching.global_reaching_centrality
    functionSourceFile: networkx.algorithms.centrality.reaching
    functionUses: 0
    functionsReached:
    - G.is_directed
    - itertools.pairwise
    - G.size
    - paths.values
    - shortest_paths.items
    - <builtin>.zip
    - <builtin>.max
    - <builtin>.sum
    - <builtin>.next
    - <builtin>.dict
    - <builtin>.len
    - networkx.is_negatively_weighted
    - networkx.utils.misc.pairwise
    - networkx.algorithms.centrality.reaching._average_weight
    - itertools.tee
    - networkx.algorithms.centrality.reaching.local_reaching_centrality
    - networkx.shortest_path
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - u
    - v
    - d
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 103
    functionName: networkx.algorithms.centrality.reaching.global_reaching_centrality.as_distance
    functionSourceFile: networkx.algorithms.centrality.reaching
    functionUses: 0
    functionsReached:
    - d.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd6c040>
    - <ast.Constant object at 0x7f734cd6c5b0>
    - <ast.Constant object at 0x7f734cd6cb80>
    argNames:
    - G
    - v
    - paths
    - weight
    - normalized
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 122
    functionName: networkx.algorithms.centrality.reaching.local_reaching_centrality
    functionSourceFile: networkx.algorithms.centrality.reaching
    functionUses: 1
    functionsReached:
    - G.is_directed
    - itertools.pairwise
    - G.size
    - <builtin>.zip
    - <builtin>.sum
    - <builtin>.len
    - networkx.utils.misc.pairwise
    - networkx.is_negatively_weighted
    - itertools.tee
    - networkx.algorithms.centrality.reaching._average_weight
    - <builtin>.next
    - networkx.shortest_path
    - paths.values
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: shortest_paths.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - u
    - v
    - d
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 192
    functionName: networkx.algorithms.centrality.reaching.local_reaching_centrality.as_distance
    functionSourceFile: networkx.algorithms.centrality.reaching
    functionUses: 0
    functionsReached:
    - d.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: paths.values
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.centrality.current_flow_betweenness
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 9
    argDefaultValues:
    - <ast.Constant object at 0x7f7343056250>
    - <ast.Constant object at 0x7f7343056220>
    - <ast.Name object at 0x7f73430561f0>
    - <ast.Constant object at 0x7f73430561c0>
    - <ast.Constant object at 0x7f7343056190>
    - <ast.Constant object at 0x7f7343056160>
    - <ast.Constant object at 0x7f7343056130>
    argNames:
    - G
    - normalized
    - weight
    - dtype
    - solver
    - epsilon
    - kmax
    - seed
    - sample_weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 26
    functionName: networkx.algorithms.centrality.current_flow_betweenness.approximate_current_flow_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.factorized
    - networkx.connected_components
    - <builtin>.sorted
    - numpy.log
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - networkx.utils.rcm.pseudo_peripheral_node
    - <builtin>.zip
    - v.min
    - seed.sample
    - G.number_of_nodes
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - <builtin>.enumerate
    - v.max
    - visited.update
    - np.nonzero
    - numpy.ceil
    - <builtin>.int
    - numpy.abs
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - C.solve
    - betweenness.items
    - networkx.shortest_path_length
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.float
    - <builtin>.isinstance
    - np.linalg.inv
    - spl.values
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - collections.deque
    - networkx.utils.misc.arbitrary_element
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - <builtin>.dict
    - collections.deque.popleft
    - dict.fromkeys
    - L.astype
    - G.degree
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: C.solve
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41460>
    - <ast.Constant object at 0x7f734cd414c0>
    - <ast.Name object at 0x7f734cd410d0>
    - <ast.Constant object at 0x7f734cd41430>
    argNames:
    - G
    - normalized
    - weight
    - dtype
    - solver
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 171
    functionName: networkx.algorithms.centrality.current_flow_betweenness.current_flow_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.factorized
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - networkx.utils.rcm.pseudo_peripheral_node
    - <builtin>.zip
    - v.min
    - G.number_of_nodes
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - <builtin>.enumerate
    - v.max
    - C.get_rows
    - visited.update
    - np.nonzero
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - networkx.algorithms.centrality.flow_matrix.flow_matrix_row
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - betweenness.items
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - np.linalg.inv
    - spl.values
    - row.item
    - G.edges
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - <builtin>.range
    - row.argsort
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - <builtin>.dict
    - collections.deque.popleft
    - dict.fromkeys
    - L.astype
    - G.degree
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: row.argsort
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3400>
    - <ast.Constant object at 0x7f734d3a3d30>
    - <ast.Name object at 0x7f734d3a3fa0>
    - <ast.Constant object at 0x7f734d3a3cd0>
    argNames:
    - G
    - normalized
    - weight
    - dtype
    - solver
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 266
    functionName: networkx.algorithms.centrality.current_flow_betweenness.edge_current_flow_betweenness_centrality
    functionSourceFile: networkx.algorithms.centrality.current_flow_betweenness
    functionUses: 0
    functionsReached:
    - scipy.sparse.linalg.factorized
    - networkx.connected_components
    - <builtin>.sorted
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width
    - np.zeros
    - networkx.utils.rcm.pseudo_peripheral_node
    - <builtin>.zip
    - v.min
    - G.number_of_nodes
    - networkx.utils.rcm.reverse_cuthill_mckee_ordering
    - <builtin>.enumerate
    - v.max
    - H.edges
    - visited.update
    - C.get_rows
    - np.nonzero
    - G.subgraph
    - <builtin>.reversed
    - <builtin>.max
    - networkx.laplacian_matrix
    - networkx.is_connected
    - <builtin>.len
    - operator.itemgetter
    - networkx.algorithms.centrality.flow_matrix.flow_matrix_row
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver
    - collections.deque.extend
    - <builtin>.next
    - networkx.utils.rcm.cuthill_mckee_ordering
    - networkx.shortest_path_length
    - betweenness.items
    - networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__
    - networkx.utils.rcm.connected_cuthill_mckee_ordering
    - <builtin>.tuple
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - np.linalg.inv
    - spl.values
    - row.item
    - G.edges
    - networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver
    - networkx.utils.misc.arbitrary_element
    - collections.deque
    - <builtin>.range
    - row.argsort
    - networkx.utils.arbitrary_element
    - spl.items
    - <builtin>.min
    - <builtin>.dict
    - collections.deque.popleft
    - dict.fromkeys
    - L.astype
    - G.degree
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.non_randomness
    functionSourceFile: networkx.algorithms.non_randomness
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4700>
    - <ast.Constant object at 0x7f734b5c4100>
    argNames:
    - G
    - k
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 14
    functionName: networkx.algorithms.non_randomness.non_randomness
    functionSourceFile: networkx.algorithms.non_randomness
    functionUses: 0
    functionsReached:
    - math.sqrt
    - numpy.linalg.eigvals
    - numpy.real
    - networkx.selfloop_edges
    - <builtin>.tuple
    - networkx.algorithms.community.label_propagation_communities
    - networkx.is_connected
    - networkx.is_empty
    - <builtin>.list
    - <builtin>.len
    - G.number_of_nodes
    - numpy.sum
    - G.number_of_edges
    - <builtin>.float
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.community.label_propagation_communities
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: numpy.linalg.eigvals
    functionSourceFile: numpy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planar_drawing
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7347129c10>
    argNames:
    - embedding
    - fully_triangulate
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 8
    functionName: networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - networkx.connected_components
    - collections.abc.Mapping.get
    - networkx.algorithms.planarity.PlanarEmbedding.connect_components
    - networkx.algorithms.planar_drawing.triangulate_face
    - <builtin>.sum
    - ready_to_pick.add
    - remaining_nodes.append
    - ready_to_pick.pop
    - <builtin>.enumerate
    - networkx.algorithms.planar_drawing.make_bi_connected
    - networkx.algorithms.planar_drawing.get_canonical_ordering.is_outer_face_nbr
    - networkx.algorithms.planar_drawing.triangulate_embedding
    - succs.pop
    - embedding.nodes
    - <builtin>.reversed
    - networkx.algorithms.planar_drawing.get_canonical_ordering.is_on_outer_face
    - <builtin>.len
    - <builtin>.set
    - ready_to_pick.discard
    - face_list.append
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    - networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - <builtin>.iter
    - collections.defaultdict
    - <builtin>.range
    - edges_counted.add
    - networkx.algorithms.planar_drawing.get_canonical_ordering
    - <builtin>.super
    - face_set.add
    - marked_nodes.add
    - wp_wq.append
    - networkx.classes.graph.Graph.nodes
    - embedding.neighbors_cw_order
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - remaining_nodes.pop
    - networkx.algorithms.planar_drawing.set_position
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: embedding.nodes
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63dd60>
    argNames:
    - embedding
    - fully_triangulate
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 336
    functionName: networkx.algorithms.planar_drawing.triangulate_embedding
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 1
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - networkx.connected_components
    - collections.abc.Mapping.get
    - networkx.algorithms.planarity.PlanarEmbedding.connect_components
    - networkx.algorithms.planar_drawing.triangulate_face
    - networkx.algorithms.planar_drawing.make_bi_connected
    - succs.pop
    - <builtin>.reversed
    - <builtin>.len
    - <builtin>.set
    - face_list.append
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    - networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.range
    - <builtin>.super
    - face_set.add
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - edges_counted.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 12
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 18
    ICount: 11
    IfCount: 12
    argCount: 2
    argDefaultValues: []
    argNames:
    - embedding
    - outer_face
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 140
    functionName: networkx.algorithms.planar_drawing.get_canonical_ordering
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - networkx.algorithms.planar_drawing.get_canonical_ordering.is_outer_face_nbr
    - <builtin>.range
    - embedding.nodes
    - networkx.algorithms.planar_drawing.get_canonical_ordering.is_on_outer_face
    - <builtin>.iter
    - ready_to_pick.add
    - <builtin>.len
    - ready_to_pick.pop
    - <builtin>.set
    - ready_to_pick.discard
    - marked_nodes.add
    - wp_wq.append
    - embedding.neighbors_cw_order
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 6
    argDefaultValues: []
    argNames:
    - parent
    - tree
    - remaining_nodes
    - delta_x
    - y_coordinate
    - pos
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 128
    functionName: networkx.algorithms.planar_drawing.set_position
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 1
    functionsReached:
    - remaining_nodes.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: remaining_nodes.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - x
    - y
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 208
    functionName: networkx.algorithms.planar_drawing.get_canonical_ordering.is_outer_face_nbr
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 215
    functionName: networkx.algorithms.planar_drawing.get_canonical_ordering.is_on_outer_face
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: embedding.neighbors_cw_order
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ready_to_pick.discard
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ready_to_pick.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: marked_nodes.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: wp_wq.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ready_to_pick.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - embedding
    - v1
    - v2
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 307
    functionName: networkx.algorithms.planar_drawing.triangulate_face
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 2
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.super
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - v
    - w
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1325
    functionName: networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    functionSourceFile: ''
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 4
    IfCount: 8
    argCount: 5
    argDefaultValues: []
    argNames:
    - self
    - start_node
    - end_node
    - cw
    - ccw
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1009
    functionName: networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 208
    functionsReached:
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - v
    - w
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1273
    functionName: networkx.algorithms.planarity.PlanarEmbedding.connect_components
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 2
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 986
    functionName: networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 4
    functionsReached:
    - <builtin>.reversed
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 9
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - embedding
    - starting_node
    - outgoing_node
    - edges_counted
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 405
    functionName: networkx.algorithms.planar_drawing.make_bi_connected
    functionSourceFile: networkx.algorithms.planar_drawing
    functionUses: 2
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - face_set.add
    - <builtin>.set
    - face_list.append
    - edges_counted.add
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: face_list.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edges_counted.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: face_set.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.tournament
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - iterable
    - condition
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 40
    functionName: networkx.algorithms.tournament.index_satisfying
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 191
    functionsReached:
    - <builtin>.enumerate
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    functionSourceFile: ''
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: hampath.insert
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e8b0>
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 156
    functionName: networkx.algorithms.tournament.random_tournament
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - <builtin>.range
    - seed.random
    - itertools.combinations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 222
    functionName: networkx.algorithms.tournament.tournament_matrix
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 0
    functionsReached:
    - networkx.adjacency_matrix
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 320
    functionName: networkx.algorithms.tournament.is_reachable.two_neighborhood
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 192
    functionsReached:
    - G._pred.items
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G._pred.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - S
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 337
    functionName: networkx.algorithms.tournament.is_reachable.is_closed
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 192
    functionsReached:
    - <builtin>.all
    - G._adj.items
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G._adj.items
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 354
    functionName: networkx.algorithms.tournament.is_strongly_connected
    functionSourceFile: networkx.algorithms.tournament
    functionUses: 0
    functionsReached:
    - networkx.algorithms.tournament.is_reachable.is_closed
    - G._pred.items
    - networkx.algorithms.tournament.is_reachable
    - <builtin>.all
    - G._adj.items
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.link_prediction
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7344934400>
    argNames:
    - G
    - func
    - ebunch
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 22
    functionName: networkx.algorithms.link_prediction._apply_prediction
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 198
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.set
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 234
    functionName: networkx.algorithms.link_prediction.adamic_adar_index.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - G.degree
    - networkx.common_neighbors
    - math.log
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 484
    functionName: networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - <builtin>.len
    - networkx.algorithms.link_prediction._community
    - networkx.common_neighbors
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 666
    functionName: networkx.algorithms.link_prediction.within_inter_cluster.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - <builtin>.len
    - networkx.algorithms.link_prediction._community
    - networkx.common_neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 404
    functionName: networkx.algorithms.link_prediction.preferential_attachment.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 167
    functionName: networkx.algorithms.link_prediction.jaccard_coefficient.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    - networkx.common_neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 572
    functionName: networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - G.degree
    - networkx.algorithms.link_prediction._community
    - networkx.common_neighbors
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 337
    functionName: networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - <builtin>.len
    - networkx.common_neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 105
    functionName: networkx.algorithms.link_prediction.resource_allocation_index.predict
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 199
    functionsReached:
    - G.degree
    - networkx.common_neighbors
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.common_neighbors
    functionSourceFile: ''
    functionUses: 206
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448550>
    - <ast.Constant object at 0x7f734c448b50>
    argNames:
    - G
    - ebunch
    - community
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 413
    functionName: networkx.algorithms.link_prediction.cn_soundarajan_hopcroft
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 0
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - u
    - community
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 679
    functionName: networkx.algorithms.link_prediction._community
    functionSourceFile: ''
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c3f8520>
    - <ast.Constant object at 0x7f734c3f8d60>
    argNames:
    - G
    - ebunch
    - community
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 499
    functionName: networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 0
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90b20>
    - <ast.Constant object at 0x7f734bc90940>
    - <ast.Constant object at 0x7f734bc90670>
    argNames:
    - G
    - ebunch
    - delta
    - community
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 586
    functionName: networkx.algorithms.link_prediction.within_inter_cluster
    functionSourceFile: networkx.algorithms.link_prediction
    functionUses: 0
    functionsReached:
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.algorithms.link_prediction._community
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction._apply_prediction
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - math.log
    - networkx.non_edges
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - <builtin>.sum
    - <builtin>.len
    - networkx.common_neighbors
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - <builtin>.set
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.algorithms.chains
    functionSourceFile: networkx.algorithms.chains
    functionUses: 0
    functionsReached:
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - <builtin>.set
    - networkx.utils.backends._dispatchable
    - networkx.utils.decorators.not_implemented_for
    - networkx.utils.decorators.argmap
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc902b0>
    argNames:
    - G
    - root
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 67
    functionName: networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    functionSourceFile: networkx.algorithms.chains
    functionUses: 191
    functionsReached:
    - attr_dict.update
    - nodes.append
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.dfs_labeled_edges
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - u
    - v
    - visited
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 123
    functionName: networkx.algorithms.chains.chain_decomposition._build_chain
    functionSourceFile: networkx.algorithms.chains
    functionUses: 191
    functionsReached:
    - visited.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.out_edges
    functionSourceFile: <builtin>
    functionUses: 191
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.node_classification
    functionSourceFile: networkx.algorithms.node_classification
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.utils.not_implemented_for
    - networkx.contracted_edge
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b1014f0>
    - <ast.Constant object at 0x7f734b1013a0>
    argNames:
    - G
    - max_iter
    - label_name
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 33
    functionName: networkx.algorithms.node_classification.harmonic_function
    functionSourceFile: networkx.algorithms.node_classification
    functionUses: 0
    functionsReached:
    - networkx.algorithms.node_classification._get_label_info
    - scipy.sparse.dia_array
    - <builtin>.range
    - <builtin>.sorted
    - labels.append
    - numpy.array
    - G.nodes
    - label_to_id.items
    - networkx.to_scipy_sparse_array
    - numpy.argmax
    - <builtin>.enumerate
    - X.sum
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - label_name
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 186
    functionName: networkx.algorithms.node_classification._get_label_info
    functionSourceFile: networkx.algorithms.node_classification
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - labels.append
    - numpy.array
    - G.nodes
    - label_to_id.items
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: X.sum
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e790>
    - <ast.Constant object at 0x7f734a65ee80>
    - <ast.Constant object at 0x7f734a65eee0>
    argNames:
    - G
    - alpha
    - max_iter
    - label_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 109
    functionName: networkx.algorithms.node_classification.local_and_global_consistency
    functionSourceFile: networkx.algorithms.node_classification
    functionUses: 0
    functionsReached:
    - networkx.algorithms.node_classification._get_label_info
    - scipy.sparse.dia_array
    - <builtin>.range
    - <builtin>.sorted
    - labels.append
    - numpy.array
    - G.nodes
    - label_to_id.items
    - numpy.sqrt
    - networkx.to_scipy_sparse_array
    - numpy.argmax
    - <builtin>.enumerate
    - X.sum
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: label_to_id.items
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.node_classification._get_label_info.<lambda1>
    functionSourceFile: networkx.algorithms.node_classification
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.euler
    functionSourceFile: networkx.algorithms.euler
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 87
    functionName: networkx.algorithms.euler._find_path_start
    functionSourceFile: networkx.algorithms.euler
    functionUses: 191
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - networkx.is_strongly_connected
    - <builtin>.all
    - networkx.is_connected
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - networkx.is_eulerian
    - networkx.classes.digraph.DiGraph.in_degree
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - <builtin>.next
    - G.in_degree
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - G.out_degree
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - networkx.is_weakly_connected
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.euler.is_eulerian
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.isinstance
    - networkx.utils.misc.arbitrary_element
    - networkx.utils.arbitrary_element
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - G.degree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - source
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 112
    functionName: networkx.algorithms.euler._simplegraph_eulerian_circuit
    functionSourceFile: networkx.algorithms.euler
    functionUses: 192
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.remove_edge
    - vertex_stack.pop
    - networkx.classes.reportviews.OutEdgeView.__init__
    - vertex_stack.append
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - <builtin>.hasattr
    - networkx.classes.digraph.DiGraph.degree
    - d.popitem
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.utils.misc.arbitrary_element
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.utils.arbitrary_element
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vertex_stack.pop
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vertex_stack.append
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - source
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 134
    functionName: networkx.algorithms.euler._multigraph_eulerian_circuit
    functionSourceFile: networkx.algorithms.euler
    functionUses: 192
    functionsReached:
    - G.is_directed
    - networkx.utils.arbitrary_element
    - vertex_stack.append
    - G.remove_edge
    - <builtin>.iter
    - vertex_stack.pop
    - <builtin>.next
    - networkx.utils.misc.arbitrary_element
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_eulerian
    functionSourceFile: ''
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 391
    functionName: networkx.algorithms.euler.eulerize
    functionSourceFile: networkx.algorithms.euler
    functionUses: 0
    functionsReached:
    - Ps.items
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - nbrs.items
    - keylist.append
    - networkx.shortest_path
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.utils.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.order
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.max_weight_matching
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.nbunch_iter
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Ps.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.time_dependent
    functionSourceFile: networkx.algorithms.time_dependent
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 5
    argDefaultValues: []
    argNames:
    - G
    - node
    - time_delta
    - time
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 12
    functionName: networkx.algorithms.time_dependent.cd_index
    functionSourceFile: networkx.algorithms.time_dependent
    functionUses: 0
    functionsReached:
    - <builtin>.round
    - pred.union
    - <builtin>.zip
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.all
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pred.union
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.operators
    functionSourceFile: networkx.algorithms.operators
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.operators.all
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 2
    argDefaultValues:
    - <ast.Tuple object at 0x7f734cf9c700>
    argNames:
    - graphs
    - rename
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 11
    functionName: networkx.algorithms.operators.all.union_all
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 1
    functionsReached:
    - G.is_directed
    - R.add_nodes_from
    - R.is_multigraph
    - R.is_directed
    - <builtin>.zip
    - G.__class__
    - G.nodes
    - R.add_edges_from
    - seen_nodes.isdisjoint
    - R.graph.update
    - <builtin>.set
    - G.is_multigraph
    - <builtin>.enumerate
    - networkx.relabel_nodes
    - itertools.repeat
    - networkx.algorithms.operators.all.union_all.add_prefix
    - G.edges
    - itertools.chain
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - graph
    - prefix
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 72
    functionName: networkx.algorithms.operators.all.union_all.add_prefix
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 2
    functionsReached:
    - networkx.relabel_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.is_directed
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seen_nodes.isdisjoint
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.graph.update
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.add_nodes_from
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - graphs
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 114
    functionName: networkx.algorithms.operators.all.disjoint_union_all
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 0
    functionsReached:
    - networkx.convert_node_labels_to_integers
    - R.is_directed
    - <builtin>.zip
    - G.__class__
    - R.graph.update
    - <builtin>.enumerate
    - itertools.repeat
    - R.add_nodes_from
    - R.is_multigraph
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.operators.all.disjoint_union_all.yield_relabeled
    - networkx.relabel_nodes
    - itertools.chain
    - G.is_directed
    - G.is_multigraph
    - networkx.algorithms.operators.all.union_all.add_prefix
    - G.edges
    - G.nodes
    - seen_nodes.isdisjoint
    - networkx.algorithms.operators.all.union_all
    - R.add_edges_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - graphs
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 156
    functionName: networkx.algorithms.operators.all.disjoint_union_all.yield_relabeled
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 1
    functionsReached:
    - <builtin>.len
    - networkx.convert_node_labels_to_integers
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - graphs
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 168
    functionName: networkx.algorithms.operators.all.compose_all
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 0
    functionsReached:
    - G.is_directed
    - R.add_nodes_from
    - R.is_multigraph
    - R.is_directed
    - G.__class__
    - G.nodes
    - R.graph.update
    - G.is_multigraph
    - <builtin>.enumerate
    - G.edges
    - R.add_edges_from
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 5
    IfCount: 6
    argCount: 1
    argDefaultValues: []
    argNames:
    - graphs
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 234
    functionName: networkx.algorithms.operators.all.intersection_all
    functionSourceFile: networkx.algorithms.operators.all
    functionUses: 0
    functionsReached:
    - G.is_directed
    - R.add_nodes_from
    - R.is_multigraph
    - G_edges_set.update
    - R.is_directed
    - G.__class__
    - <builtin>.list
    - <builtin>.set
    - G.is_multigraph
    - <builtin>.enumerate
    - R.add_edges_from
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_edges_set.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.operators.product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - d1
    - d2
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 23
    functionName: networkx.algorithms.operators.product._dict_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 10
    functionsReached:
    - <builtin>.set
    - d1.get
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: d1.get
    functionSourceFile: <builtin>
    functionUses: 11
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 28
    functionName: networkx.algorithms.operators.product._node_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 7
    functionsReached:
    - networkx.algorithms.operators.product._dict_product
    - d1.get
    - <builtin>.set
    - itertools.product
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 33
    functionName: networkx.algorithms.operators.product._directed_edges_cross_edges
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 2
    functionsReached:
    - networkx.algorithms.operators.product._dict_product
    - d1.get
    - H.is_multigraph
    - <builtin>.set
    - G.is_multigraph
    - H.edges
    - G.edges
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.is_multigraph
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 52
    functionName: networkx.algorithms.operators.product._undirected_edges_cross_edges
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 2
    functionsReached:
    - networkx.algorithms.operators.product._dict_product
    - d1.get
    - H.is_multigraph
    - <builtin>.set
    - G.is_multigraph
    - H.edges
    - G.edges
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 71
    functionName: networkx.algorithms.operators.product._edges_cross_nodes
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 4
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - G.is_multigraph
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 85
    functionName: networkx.algorithms.operators.product._nodes_cross_edges
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 5
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.hasattr
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - G.is_multigraph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 99
    functionName: networkx.algorithms.operators.product._edges_cross_nodes_and_nodes
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 1
    functionsReached:
    - H.is_multigraph
    - G.is_multigraph
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 0
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 115
    functionName: networkx.algorithms.operators.product._init_product_graph
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 8
    functionsReached:
    - collections.abc.Mapping.attr.items
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.get
    - attr.copy
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - keydict.items
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multigraph.MultiGraph.to_directed
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - <builtin>.iter
    - attr.pop
    - d.items
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - datadict.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.classes.graph.Graph.add_node
    - networkx.freeze
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.graph.Graph.__iter__
    - copy.deepcopy
    - networkx.drawing.nx_agraph.from_agraph
    - collections.abc.Mapping.items
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 129
    functionName: networkx.algorithms.operators.product.tensor_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.operators.product._directed_edges_cross_edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.operators.product._undirected_edges_cross_edges
    - datadict.update
    - collections.abc.Mapping.keys
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - H.edges
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - itertools.product
    - G.edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - H.is_multigraph
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 185
    functionName: networkx.algorithms.operators.product.cartesian_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 2
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.operators.product._edges_cross_nodes
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.operators.product._nodes_cross_edges
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - itertools.product
    - G.edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 237
    functionName: networkx.algorithms.operators.product.lexicographic_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.operators.product._nodes_cross_edges
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - itertools.product
    - G.edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - H.is_multigraph
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.algorithms.operators.product._edges_cross_nodes_and_nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 290
    functionName: networkx.algorithms.operators.product.strong_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.operators.product._directed_edges_cross_edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.operators.product._edges_cross_nodes
    - networkx.algorithms.operators.product._undirected_edges_cross_edges
    - datadict.update
    - collections.abc.Mapping.keys
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - H.edges
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.operators.product._nodes_cross_edges
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - itertools.product
    - G.edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - H.is_multigraph
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 350
    functionName: networkx.algorithms.operators.product.power
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - nextlevel.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - attr.copy
    - <builtin>.iter
    - newdict.update
    - <builtin>.len
    - networkx.classes.graph.Graph.__iter__
    - keylist.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nextlevel.update
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - G
    - H
    - root
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 439
    functionName: networkx.algorithms.operators.product.rooted_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - H.edges
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.iter
    - itertools.product
    - G.edges
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 6
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 479
    functionName: networkx.algorithms.operators.product.corona_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - N.graph.update
    - H.edges.data
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.edges.data
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 544
    functionName: networkx.algorithms.operators.product.modular_product
    functionSourceFile: networkx.algorithms.operators.product
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multigraph.MultiGraph.to_directed
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.complement
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - newdict.update
    - H.edges
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - H.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - itertools.product
    - G.edges
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - H.is_multigraph
    - networkx.classes.digraph.DiGraph.__init__
    - d.items
    - N.graph.update
    - networkx.freeze
    - result.graph.update
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.operators.binary
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Tuple object at 0x7f734b6e7520>
    argNames:
    - G
    - H
    - rename
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 20
    functionName: networkx.algorithms.operators.binary.union
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 1
    functionsReached:
    - networkx.union_all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.union_all
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 84
    functionName: networkx.algorithms.operators.binary.disjoint_union
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - networkx.disjoint_union_all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.disjoint_union_all
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 138
    functionName: networkx.algorithms.operators.binary.intersection
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - networkx.intersection_all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.intersection_all
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 183
    functionName: networkx.algorithms.operators.binary.difference
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - networkx.create_empty_copy
    - H.is_multigraph
    - <builtin>.set
    - G.is_multigraph
    - H.has_edge
    - R.add_edge
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.create_empty_copy
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: R.add_edge
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 238
    functionName: networkx.algorithms.operators.binary.symmetric_difference
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - R.add_nodes_from
    - networkx.create_empty_copy
    - G.has_edge
    - <builtin>.set
    - H.is_multigraph
    - G.is_multigraph
    - H.has_edge
    - gnodes.symmetric_difference
    - R.add_edge
    - H.edges
    - G.edges
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gnodes.symmetric_difference
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - H
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 301
    functionName: networkx.algorithms.operators.binary.compose
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - networkx.compose_all
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.compose_all
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Tuple object at 0x7f734ceff700>
    argNames:
    - G
    - H
    - rename
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 383
    functionName: networkx.algorithms.operators.binary.full_join
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 0
    functionsReached:
    - networkx.algorithms.operators.binary.full_join.add_prefix
    - R.is_directed
    - networkx.union_all
    - <builtin>.iter
    - networkx.algorithms.operators.binary.union
    - networkx.classes.graph.Graph.__iter__
    - networkx.relabel_nodes
    - R.add_edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - graph
    - prefix
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 448
    functionName: networkx.algorithms.operators.binary.full_join.add_prefix
    functionSourceFile: networkx.algorithms.operators.binary
    functionUses: 1
    functionsReached:
    - networkx.relabel_nodes
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.operators.unary
    functionSourceFile: networkx.algorithms.operators.unary
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.algorithms.operators.unary.complement
    functionSourceFile: networkx.algorithms.operators.unary
    functionUses: 0
    functionsReached:
    - R.add_nodes_from
    - G.__class__
    - G.adjacency
    - R.add_edges_from
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8d90>
    argNames:
    - G
    - copy
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 45
    functionName: networkx.algorithms.operators.unary.reverse
    functionSourceFile: networkx.algorithms.operators.unary
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.hasattr
    - networkx.reverse_view
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - copy.deepcopy
    - H.add_edges_from
    - H.add_nodes_from
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - H.graph.update
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734538a4c0>
    argNames:
    - G
    - counterexample
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 43
    functionName: networkx.algorithms.planarity.check_planarity
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 192
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - keydict.get
    - attr.copy
    - networkx.classes.digraph.DiGraph.remove_edge
    - newdict.update
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - <builtin>.sum
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.get_counterexample
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - succs.pop
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.digraph.DiGraph.degree
    - d.popitem
    - <builtin>.hasattr
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.planarity.LRPlanarity.sign
    - <builtin>.list
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.ConflictPair.__init__
    - collections.defaultdict
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - Q.right.copy
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.planarity.top_of_stack
    - <builtin>.min
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - dfs_stack.pop
    - networkx._clear_cache
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - G
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 283
    functionName: networkx.algorithms.planarity.LRPlanarity.__init__
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 195
    functionsReached:
    - collections.defaultdict
    - datadict.update
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - attr.copy
    - keydict.get
    - <builtin>.iter
    - <builtin>.super
    - newdict.update
    - <builtin>.len
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 323
    functionName: networkx.algorithms.planarity.LRPlanarity.lr_planarity
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 193
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - succs.pop
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - <builtin>.next
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.planarity.LRPlanarity.sign
    - <builtin>.list
    - dfs_stack.append
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.ConflictPair.__init__
    - collections.defaultdict
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - Q.right.copy
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.planarity.top_of_stack
    - <builtin>.min
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - dfs_stack.pop
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 135
    functionName: networkx.algorithms.planarity.get_counterexample
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 192
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - keydict.get
    - attr.copy
    - networkx.classes.digraph.DiGraph.remove_edge
    - newdict.update
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - <builtin>.sum
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.get_counterexample
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - succs.pop
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.digraph.DiGraph.degree
    - d.popitem
    - <builtin>.hasattr
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.planarity.LRPlanarity.sign
    - <builtin>.list
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.ConflictPair.__init__
    - collections.defaultdict
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - Q.right.copy
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.planarity.top_of_stack
    - <builtin>.min
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - dfs_stack.pop
    - networkx._clear_cache
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7349642970>
    argNames:
    - G
    - counterexample
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 119
    functionName: networkx.algorithms.planarity.check_planarity_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 1
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing_recursive
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - keydict.get
    - attr.copy
    - networkx.classes.digraph.DiGraph.remove_edge
    - newdict.update
    - <builtin>.sum
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding_recursive
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - succs.pop
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.planarity.get_counterexample_recursive
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - d.popitem
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.planarity.LRPlanarity.sign_recursive
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation_recursive
    - networkx.algorithms.planarity.ConflictPair.__init__
    - collections.defaultdict
    - networkx.algorithms.planarity.check_planarity_recursive
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - Q.right.copy
    - networkx.algorithms.planarity.top_of_stack
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity_recursive
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 6
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 402
    functionName: networkx.algorithms.planarity.LRPlanarity.lr_planarity_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 2
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing_recursive
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - attr.copy
    - <builtin>.sum
    - keydict.get
    - newdict.update
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding_recursive
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - succs.pop
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - <builtin>.next
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.planarity.LRPlanarity.sign_recursive
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation_recursive
    - networkx.algorithms.planarity.ConflictPair.__init__
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - Q.right.copy
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.top_of_stack
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 174
    functionName: networkx.algorithms.planarity.get_counterexample_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 1
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - <builtin>.sorted
    - collections.abc.Mapping.get
    - Q.swap
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing_recursive
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.planarity.Interval.__init__
    - keydict.get
    - attr.copy
    - networkx.classes.digraph.DiGraph.remove_edge
    - newdict.update
    - <builtin>.sum
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding_recursive
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - succs.pop
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.algorithms.planarity.Interval.empty
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.algorithms.planarity.get_counterexample_recursive
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - d.popitem
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.planarity.LRPlanarity.sign_recursive
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation_recursive
    - networkx.algorithms.planarity.ConflictPair.__init__
    - networkx.algorithms.planarity.check_planarity_recursive
    - collections.defaultdict
    - Q.left.empty
    - networkx.classes.graph.Graph.order
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - Q.right.copy
    - networkx.algorithms.planarity.top_of_stack
    - networkx.classes.graph.Graph.nbunch_iter
    - <builtin>.min
    - <builtin>.super
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity_recursive
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734caf33d0>
    - <ast.Constant object at 0x7f734cc5b5e0>
    argNames:
    - self
    - low
    - high
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 204
    functionName: networkx.algorithms.planarity.Interval.__init__
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 208
    functionName: networkx.algorithms.planarity.Interval.empty
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 202
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 212
    functionName: networkx.algorithms.planarity.Interval.copy
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.Interval.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - b
    - planarity_state
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 216
    functionName: networkx.algorithms.planarity.Interval.conflicting
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.Interval.empty
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Call object at 0x7f734b5e1d30>
    - <ast.Call object at 0x7f734a9ed250>
    argNames:
    - self
    - left
    - right
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 231
    functionName: networkx.algorithms.planarity.ConflictPair.__init__
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 235
    functionName: networkx.algorithms.planarity.ConflictPair.swap
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - planarity_state
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 241
    functionName: networkx.algorithms.planarity.ConflictPair.lowest
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.Interval.empty
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - l
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 252
    functionName: networkx.algorithms.planarity.top_of_stack
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 201
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.__init__.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.__init__.<lambda2>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.__init__.<lambda3>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.__init__.<lambda4>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73496753a0>
    argNames:
    - self
    - incoming_graph_data
    - attr
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 859
    functionName: networkx.algorithms.planarity.PlanarEmbedding.__init__
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 196
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 4
    IfCount: 7
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 449
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 194
    functionsReached:
    - collections.defaultdict
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - <builtin>.min
    - keydict.get
    - dfs_stack.append
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - dfs_stack.pop
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.lr_planarity.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 535
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_testing
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 194
    functionsReached:
    - collections.defaultdict
    - Q.left.empty
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - Q.swap
    - Q.right.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.Interval.__init__
    - networkx.algorithms.planarity.top_of_stack
    - dfs_stack.append
    - Q.left.copy
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.planarity.Interval.empty
    - dfs_stack.pop
    - networkx.algorithms.planarity.ConflictPair.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 741
    functionName: networkx.algorithms.planarity.LRPlanarity.sign
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 194
    functionsReached:
    - collections.defaultdict
    - dfs_stack.pop
    - dfs_stack.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.lr_planarity.<lambda2>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 6
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 694
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 194
    functionsReached:
    - collections.defaultdict
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - dfs_stack.append
    - <builtin>.super
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - <builtin>.next
    - dfs_stack.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 3
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 502
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_orientation_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 3
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.min
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation_recursive
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.lr_planarity_recursive.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 3
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 584
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_testing_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 3
    functionsReached:
    - Q.left.empty
    - Q.swap
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - Q.right.copy
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing_recursive
    - networkx.algorithms.planarity.Interval.__init__
    - networkx.algorithms.planarity.top_of_stack
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.Interval.empty
    - networkx.algorithms.planarity.ConflictPair.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 761
    functionName: networkx.algorithms.planarity.LRPlanarity.sign_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 3
    functionsReached:
    - networkx.algorithms.planarity.LRPlanarity.sign_recursive
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.lr_planarity_recursive.<lambda2>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 723
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_embedding_recursive
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 3
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding_recursive
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_orientation.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_orientation.<lambda2>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dfs_stack.pop
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dfs_stack.append
    functionSourceFile: <builtin>
    functionUses: 198
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_testing.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_testing.<lambda2>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 3
    IfCount: 10
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - ei
    - e
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 611
    functionName: networkx.algorithms.planarity.LRPlanarity.add_constraints
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 199
    functionsReached:
    - Q.left.empty
    - Q.swap
    - Q.right.copy
    - networkx.algorithms.planarity.top_of_stack
    - Q.left.copy
    - Q.right.conflicting
    - networkx.algorithms.planarity.Interval.empty
    - networkx.algorithms.planarity.ConflictPair.__init__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 1
    IfCount: 6
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 655
    functionName: networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 199
    functionsReached:
    - networkx.algorithms.planarity.top_of_stack
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.left.empty
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.swap
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.right.copy
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.right.conflicting
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: Q.left.copy
    functionSourceFile: <builtin>
    functionUses: 200
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.dfs_embedding.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - start_node
    - end_node
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1303
    functionName: networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 199
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.planarity.LRPlanarity.sign.<lambda1>
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 875
    functionName: networkx.algorithms.planarity.PlanarEmbedding.get_data
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order
    - <builtin>.next
    - <builtin>.reversed
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - data
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 894
    functionName: networkx.algorithms.planarity.PlanarEmbedding.set_data
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.abc.Mapping.get
    functionSourceFile: collections
    functionUses: 209
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: succs.pop
    functionSourceFile: <builtin>
    functionUses: 209
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1084
    functionName: networkx.algorithms.planarity.PlanarEmbedding.check_structure
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.connected_components
    - networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    - networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order
    - <builtin>.reversed
    - networkx.algorithms.planarity.PlanarEmbedding.traverse_face
    - face_nodes.append
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.len
    - <builtin>.set
    - mark_half_edges.add
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7346be70d0>
    argNames:
    - self
    - v
    - w
    - mark_half_edges
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1340
    functionName: networkx.algorithms.planarity.PlanarEmbedding.traverse_face
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 1
    functionsReached:
    - <builtin>.set
    - face_nodes.append
    - networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge
    - mark_half_edges.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - start_node
    - end_node
    - reference_neighbor
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1142
    functionName: networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_ccw
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - start_node
    - end_node
    - reference_neighbor
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 1171
    functionName: networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_cw
    functionSourceFile: networkx.algorithms.planarity
    functionUses: 0
    functionsReached:
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - collections.abc.Mapping.get
    - succs.pop
    - <builtin>.reversed
    - <builtin>.super
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: mark_half_edges.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: face_nodes.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.generators
    functionSourceFile: networkx.generators
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.interval_graph
    functionSourceFile: networkx.generators.interval_graph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - intervals
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 13
    functionName: networkx.generators.interval_graph.interval_graph
    functionSourceFile: networkx.generators.interval_graph
    functionUses: 0
    functionsReached:
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.tuple
    - tupled_intervals.pop
    - attr.copy
    - keydict.get
    - <builtin>.list
    - <builtin>.len
    - newdict.update
    - <builtin>.iter
    - networkx.classes.graph.Graph.__iter__
    - networkx._clear_cache
    - networkx.classes.reportviews.NodeView.__iter__
    - <builtin>.isinstance
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - ValueError
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tupled_intervals.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.lattice
    functionSourceFile: networkx.generators.lattice
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - collections.deque
    - G.reverse
    - unmatched.append
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - networkx.algorithms.approximation.clique.large_clique_size
    - B_cal_prime.add
    - queue.popleft
    - networkx.algorithms.chordal.chordal_graph_cliques
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - unseen.remove
    - marked.update
    - A.edges
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.utils.decorators.nodes_or_number
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.int
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.bfs_layers
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.non_edges
    - d.copy
    - networkx.algorithms.smallworld.sigma
    - networkx.classes.reportviews.InEdgeView.__init__
    - G.successors
    - networkx.is_dominating_set
    - length.items
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d64bbe0>
    - <ast.Constant object at 0x7f734d64bdf0>
    argNames:
    - m
    - n
    - periodic
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 37
    functionName: networkx.generators.lattice.grid_2d_graph
    functionSourceFile: networkx.generators.lattice
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - newdict.update
    - keydict.get
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.empty_graph
    - <builtin>.iter
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - datadict.items
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - result.graph.update
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.tee
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26430>
    - <ast.Constant object at 0x7f734cf26550>
    - <ast.Name object at 0x7f734cf26700>
    argNames:
    - n
    - create_using
    - default
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 566
    functionName: networkx.generators.classic.empty_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 46
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a39d0>
    argNames:
    - dim
    - periodic
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 96
    functionName: networkx.generators.lattice.grid_graph
    functionSourceFile: networkx.generators.lattice
    functionUses: 1
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - H.add_edges_from
    - mapping.keys
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.operators.product._edges_cross_nodes
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - seen_edges.add
    - networkx.classes.multigraph.MultiGraph.to_directed
    - H.graph.update
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.selfloop_edges
    - networkx.algorithms.operators.all.union_all.add_prefix.label
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.operators.product.cartesian_product
    - G.is_directed
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.callable
    - networkx.relabel._relabel_inplace
    - H.add_nodes_from
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.operators.binary.full_join.add_prefix.label
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - mapping.values
    - newdict.update
    - result.append
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.operators.product._nodes_cross_edges
    - <builtin>.tuple
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - mapping.items
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.utils.misc.flatten
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - itertools.product
    - G.edges
    - networkx.relabel._relabel_copy
    - networkx.relabel.relabel_nodes
    - mapping.get
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.topological_sort
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - itertools.repeat
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - H._node.update
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.freeze
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 160
    functionName: networkx.generators.lattice.hypercube_graph
    functionSourceFile: networkx.generators.lattice
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - H.add_edges_from
    - mapping.keys
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.operators.product._edges_cross_nodes
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - ddd.update
    - collections.abc.Mapping.keys
    - networkx.convert.from_dict_of_lists
    - seen_edges.add
    - networkx.classes.multigraph.MultiGraph.to_directed
    - H.graph.update
    - attr_dict.update
    - d1.get
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.selfloop_edges
    - networkx.algorithms.operators.all.union_all.add_prefix.label
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.operators.product._dict_product
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - copy.deepcopy
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keydict.items
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.operators.product.cartesian_product
    - G.is_directed
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.to_directed_class
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.callable
    - networkx.relabel._relabel_inplace
    - H.add_nodes_from
    - <builtin>.isinstance
    - networkx.algorithms.operators.product._node_product
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.operators.binary.full_join.add_prefix.label
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - G.graph.update
    - G.__class__
    - networkx.classes.graph.Graph.to_directed_class
    - mapping.values
    - newdict.update
    - result.append
    - G.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.operators.product._nodes_cross_edges
    - <builtin>.tuple
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - mapping.items
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.utils.misc.flatten
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.operators.product._init_product_graph
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - itertools.product
    - G.edges
    - networkx.relabel._relabel_copy
    - networkx.relabel.relabel_nodes
    - mapping.get
    - networkx.classes.graphviews.generic_graph_view
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - collections.abc.Mapping.items
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.topological_sort
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - networkx.from_numpy_array
    - <builtin>.enumerate
    - itertools.repeat
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.reversed
    - networkx.generators.lattice.grid_graph
    - H._node.update
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.classes.digraph.DiGraph.in_edges
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.freeze
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.graph.Graph.to_directed
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - d2.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 7
    IfCount: 7
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf26cd0>
    - <ast.Constant object at 0x7f734cf26310>
    - <ast.Constant object at 0x7f734cf26700>
    argNames:
    - m
    - n
    - periodic
    - with_positions
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 200
    functionName: networkx.generators.lattice.triangular_lattice_graph
    functionSourceFile: networkx.generators.lattice
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.remove_nodes_from
    - <builtin>.zip
    - values.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - math.sqrt
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.function.set_node_attributes
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - datadict.items
    - <builtin>.iter
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.contracted_nodes
    - networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 7
    IfCount: 5
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a700>
    - <ast.Constant object at 0x7f734b77a5b0>
    - <ast.Constant object at 0x7f734b77a550>
    argNames:
    - m
    - n
    - periodic
    - with_positions
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 307
    functionName: networkx.generators.lattice.hexagonal_lattice_graph
    functionSourceFile: networkx.generators.lattice
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - values.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - math.sqrt
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.function.set_node_attributes
    - <builtin>.list
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - datadict.items
    - d.items
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.contracted_nodes
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.classic
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - collections.deque
    - G.reverse
    - unmatched.append
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - networkx.algorithms.approximation.clique.large_clique_size
    - B_cal_prime.add
    - queue.popleft
    - networkx.algorithms.chordal.chordal_graph_cliques
    - networkx.classes.coreviews.FilterAtlas.__init__
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - unseen.remove
    - marked.update
    - A.edges
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.utils.decorators.nodes_or_number
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.int
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.bfs_layers
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.non_edges
    - d.copy
    - networkx.algorithms.smallworld.sigma
    - networkx.classes.reportviews.InEdgeView.__init__
    - G.successors
    - networkx.is_dominating_set
    - length.items
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 51
    functionName: networkx.generators.classic._tree_edges
    functionSourceFile: networkx.generators.classic
    functionUses: 2
    functionsReached:
    - <builtin>.range
    - parents.append
    - <builtin>.iter
    - parents.pop
    - <builtin>.next
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: parents.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: parents.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f7343ffd940>
    argNames:
    - r
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 70
    functionName: networkx.generators.classic.full_rary_tree
    functionSourceFile: networkx.generators.classic
    functionUses: 1
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - networkx.generators.classic._tree_edges
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - <builtin>.range
    - parents.append
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - parents.pop
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 108
    functionName: networkx.generators.classic.kneser_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - keydict.get
    - attr.copy
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e0a0>
    argNames:
    - r
    - h
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 155
    functionName: networkx.generators.classic.balanced_tree
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - networkx.generators.classic._tree_edges
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - <builtin>.range
    - parents.append
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.generators.classic.full_rary_tree
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - parents.pop
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 6
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e880>
    argNames:
    - m1
    - m2
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 205
    functionName: networkx.generators.classic.barbell_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - itertools.permutations
    - attr.copy
    - keydict.get
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.__init__
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.__iter__
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb0a0>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 317
    functionName: networkx.generators.classic.complete_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 7
    functionsReached:
    - collections.abc.Mapping.attr.items
    - itertools.permutations
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - keylist.append
    - <builtin>.str
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55370>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 278
    functionName: networkx.generators.classic.binomial_tree
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.range
    - <builtin>.hasattr
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - keydict.get
    - networkx.empty_graph
    - <builtin>.len
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf760>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 364
    functionName: networkx.generators.classic.circular_ladder_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.ladder_graph
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.from_pandas_edgelist
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - attr.items
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ceff400>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 664
    functionName: networkx.generators.classic.ladder_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 1
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a0d0>
    argNames:
    - n
    - offsets
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 384
    functionName: networkx.generators.classic.circulant_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448970>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 458
    functionName: networkx.generators.classic.cycle_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 8
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - itertools.pairwise
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - datadict.items
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 5
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccffb50>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 489
    functionName: networkx.generators.classic.dorogovtsev_goltsev_mendes_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - nbrs.items
    - attr.copy
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - result.graph.update
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - new_edges.append
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d611d60>
    argNames:
    - m
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 688
    functionName: networkx.generators.classic.lollipop_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - itertools.permutations
    - attr.copy
    - keydict.get
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - <builtin>.next
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.__init__
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - datadict.items
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.__iter__
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734b9e1d00>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 754
    functionName: networkx.generators.classic.null_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd248b0>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 766
    functionName: networkx.generators.classic.path_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 3
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - itertools.pairwise
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - attr.pop
    - d.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - datadict.items
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3a90>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 792
    functionName: networkx.generators.classic.star_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 2
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - nodes.append
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - ddd.update
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a67f850>
    argNames:
    - m
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 856
    functionName: networkx.generators.classic.tadpole_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - keydict.get
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - itertools.pairwise
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - <builtin>.next
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.add_path
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.tee
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.add_path
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f7342db3fa0>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 917
    functionName: networkx.generators.classic.trivial_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - r
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 930
    functionName: networkx.generators.classic.turan_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - <builtin>.enumerate
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - networkx.empty_graph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - itertools.product
    - <builtin>.range
    - networkx.generators.classic.complete_multipartite_graph
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.accumulate
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - itertools.combinations
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.__iter__
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - subset_sizes
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 1004
    functionName: networkx.generators.classic.complete_multipartite_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 1
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - <builtin>.enumerate
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - networkx.empty_graph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - itertools.product
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.accumulate
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - itertools.combinations
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.__iter__
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7342db3070>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 969
    functionName: networkx.generators.classic.wheel_graph
    functionSourceFile: networkx.generators.classic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - itertools.tee
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.time_series
    functionSourceFile: networkx.generators.time_series
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - series
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 13
    functionName: networkx.generators.time_series.visibility_graph
    functionSourceFile: networkx.generators.time_series
    functionUses: 0
    functionsReached:
    - networkx.path_graph
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - itertools.combinations
    - <builtin>.dict
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.set_node_attributes
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.path_graph
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.expanders
    functionSourceFile: networkx.generators.expanders
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.utils.decorators.np_random_state
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.contracted_edge
    - networkx.utils.not_implemented_for
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7344189940>
    argNames:
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 51
    functionName: networkx.generators.expanders.margulis_gabber_galil_graph
    functionSourceFile: networkx.generators.expanders
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - itertools.product
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbe87f0>
    argNames:
    - p
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 94
    functionName: networkx.generators.expanders.chordal_cycle_graph
    functionSourceFile: networkx.generators.expanders
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - <builtin>.pow
    - keydict.get
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: <builtin>.pow
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9c2e0>
    argNames:
    - p
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 158
    functionName: networkx.generators.expanders.paley_graph
    functionSourceFile: networkx.generators.expanders
    functionUses: 0
    functionsReached:
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 5
    argDefaultValues: []
    argNames:
    - n
    - d
    - create_using
    - max_tries
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 220
    functionName: networkx.generators.expanders.maybe_regular_expander_graph
    functionSourceFile: networkx.generators.expanders
    functionUses: 2
    functionsReached:
    - keydict.get
    - keylist.append
    - cycle.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.utils.pairwise
    - edges.update
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - cycles.append
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - seed.permutation
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.permutation
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues: []
    argNames:
    - n
    - d
    - create_using
    - max_tries
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 336
    functionName: networkx.generators.expanders.maybe_regular_expander
    functionSourceFile: networkx.generators.expanders
    functionUses: 0
    functionsReached:
    - keydict.get
    - keylist.append
    - warnings.warn
    - cycle.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.utils.pairwise
    - edges.update
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - cycles.append
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.generators.expanders.maybe_regular_expander_graph
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - seed.permutation
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - epsilon
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 359
    functionName: networkx.generators.expanders.is_regular_expander
    functionSourceFile: networkx.generators.expanders
    functionUses: 1
    functionsReached:
    - networkx.utils.arbitrary_element
    - numpy.sqrt
    - <builtin>.min
    - scipy.sparse.linalg.eigsh
    - networkx.adjacency_matrix
    - <builtin>.abs
    - networkx.is_regular
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 6
    argDefaultValues: []
    argNames:
    - n
    - d
    - epsilon
    - create_using
    - max_tries
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 428
    functionName: networkx.generators.expanders.random_regular_expander_graph
    functionSourceFile: networkx.generators.expanders
    functionUses: 0
    functionsReached:
    - numpy.sqrt
    - keydict.get
    - keylist.append
    - <builtin>.abs
    - cycle.append
    - networkx.is_regular
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.bool
    - networkx.utils.pairwise
    - edges.update
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - cycles.append
    - <builtin>.len
    - networkx.adjacency_matrix
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.generators.expanders.is_regular_expander
    - networkx.generators.expanders.maybe_regular_expander_graph
    - <builtin>.range
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.min
    - scipy.sparse.linalg.eigsh
    - networkx.empty_graph
    - seed.permutation
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.mycielski
    functionSourceFile: networkx.generators.mycielski
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 6
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a5bb7f0>
    argNames:
    - G
    - iterations
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 15
    functionName: networkx.generators.mycielski.mycielskian
    functionSourceFile: networkx.generators.mycielski
    functionUses: 1
    functionsReached:
    - networkx.convert_node_labels_to_integers
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - attr_dict.update
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 72
    functionName: networkx.generators.mycielski.mycielski_graph
    functionSourceFile: networkx.generators.mycielski
    functionUses: 0
    functionsReached:
    - networkx.path_graph
    - networkx.convert_node_labels_to_integers
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - networkx.generators.mycielski.mycielskian
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - attr_dict.update
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.empty_graph
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.graph.Graph.number_of_nodes
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.harary_graph
    functionSourceFile: networkx.generators.harary_graph
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65ea60>
    argNames:
    - n
    - m
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 25
    functionName: networkx.generators.harary_graph.hnm_harary_graph
    functionSourceFile: networkx.generators.harary_graph
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - networkx.circulant_graph
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.circulant_graph
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3a60>
    argNames:
    - k
    - n
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 99
    functionName: networkx.generators.harary_graph.hkn_harary_graph
    functionSourceFile: networkx.generators.harary_graph
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.path_graph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - networkx.circulant_graph
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.degree_seq
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - degree_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 24
    functionName: networkx.generators.degree_seq._to_stublist
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 3
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.enumerate
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 5
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7348e5db80>
    - <ast.Constant object at 0x7f7348e5db50>
    - <ast.Constant object at 0x7f7348e5db20>
    argNames:
    - deg_sequence
    - create_using
    - directed
    - in_deg_sequence
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 56
    functionName: networkx.generators.degree_seq._configuration_model
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 2
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.zip
    - keydict.get
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.degree_seq._to_stublist
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - itertools.zip_longest
    - <builtin>.list
    - seed.shuffle
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb7ec70>
    - <ast.Constant object at 0x7f734bb7e850>
    argNames:
    - deg_sequence
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 127
    functionName: networkx.generators.degree_seq.configuration_model
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.zip
    - keydict.get
    - <builtin>.sum
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.generators.degree_seq._to_stublist
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - itertools.zip_longest
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.list
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - seed.shuffle
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.generators.degree_seq._configuration_model
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90a30>
    - <ast.Constant object at 0x7f734bc90c40>
    argNames:
    - in_degree_sequence
    - out_degree_sequence
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 230
    functionName: networkx.generators.degree_seq.directed_configuration_model
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - itertools.chain.from_iterable
    - <builtin>.zip
    - keydict.get
    - <builtin>.sum
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.degree_seq._to_stublist
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - itertools.zip_longest
    - <builtin>.list
    - seed.shuffle
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.generators.degree_seq._configuration_model
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 2
    IfCount: 6
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734ccfb7c0>
    - <ast.Constant object at 0x7f734ccfb820>
    argNames:
    - w
    - seed
    - selfloops
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 333
    functionName: networkx.generators.degree_seq.expected_degree_graph
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - seed.random
    - keydict.get
    - <builtin>.sum
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - math.floor
    - <builtin>.len
    - operator.itemgetter
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - <builtin>.min
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.floor
    functionSourceFile: math
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b691130>
    argNames:
    - deg_sequence
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 442
    functionName: networkx.generators.degree_seq.havel_hakimi_graph
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.is_graphical
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.max
    - networkx._clear_cache
    - keydict.get
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.is_graphical
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 13
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 8
    EdgeCount: 19
    ICount: 9
    IfCount: 13
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734d4b0460>
    argNames:
    - in_deg_sequence
    - out_deg_sequence
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 535
    functionName: networkx.generators.degree_seq.directed_havel_hakimi_graph
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - zeroheap.append
    - heapq.heappop
    - keydict.get
    - networkx._clear_cache
    - <builtin>.len
    - networkx.utils.make_list_of_ints
    - heapq.heappush
    - heapq.heapify
    - networkx.empty_graph
    - stubheap.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3640>
    argNames:
    - deg_sequence
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 647
    functionName: networkx.generators.degree_seq.degree_sequence_tree
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - deg.pop
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.utils.is_valid_tree_degree_sequence
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - attr_dict.update
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.add_path
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.is_valid_tree_degree_sequence
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: deg.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734c43e3a0>
    - <ast.Constant object at 0x7f734c43e8b0>
    argNames:
    - sequence
    - seed
    - tries
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 713
    functionName: networkx.generators.degree_seq.random_degree_sequence_graph
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 0
    functionsReached:
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.__init__
    - <builtin>.sorted
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.generate
    - seed.random
    - rng.choice
    - attr.copy
    - <builtin>.sum
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.p
    - networkx.classes.digraph.DiGraph.remove_edge
    - newdict.update
    - keydict.get
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase3
    - networkx.classes.reportviews.OutEdgeView.__init__
    - rng.random
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase1
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.suitable_edge
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase2
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - collections.Counter.items
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - d.popitem
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.utils.random_sequence.weighted_choice
    - <builtin>.list
    - <builtin>.iter
    - networkx.utils.random_sequence.random_weighted_sample
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.q
    - rng.sample
    - <builtin>.range
    - networkx.is_graphical
    - collections.Counter.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - rem_deg.values
    - sample.add
    - <builtin>.dict
    - itertools.combinations
    - remaining_deg.keys
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - degree
    - rng
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 778
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.__init__
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 1
    functionsReached:
    - <builtin>.max
    - networkx.is_graphical
    - <builtin>.sum
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 790
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.generate
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - seed.random
    - rng.choice
    - attr.copy
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.p
    - networkx.classes.digraph.DiGraph.remove_edge
    - <builtin>.sum
    - newdict.update
    - keydict.get
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase3
    - networkx.classes.reportviews.OutEdgeView.__init__
    - rng.random
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase1
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.suitable_edge
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase2
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - collections.Counter.items
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - d.popitem
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.utils.random_sequence.weighted_choice
    - <builtin>.list
    - <builtin>.iter
    - networkx.utils.random_sequence.random_weighted_sample
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.q
    - rng.sample
    - collections.Counter.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - rem_deg.values
    - sample.add
    - <builtin>.dict
    - itertools.combinations
    - remaining_deg.keys
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 843
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase1
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - seed.random
    - keydict.get
    - <builtin>.sum
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.p
    - networkx.classes.digraph.DiGraph.remove_edge
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - collections.Counter.items
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.graph.Graph.remove_node
    - d.popitem
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.utils.random_sequence.weighted_choice
    - <builtin>.list
    - networkx.utils.random_sequence.random_weighted_sample
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - collections.Counter.values
    - rem_deg.values
    - sample.add
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 854
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase2
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - keydict.get
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.p
    - networkx.classes.digraph.DiGraph.remove_edge
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - rng.random
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.graph.Graph.remove_node
    - d.popitem
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.q
    - rng.sample
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - remaining_deg.keys
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 869
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase3
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 2
    functionsReached:
    - <builtin>.sorted
    - rng.choice
    - keydict.get
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.p
    - networkx.classes.digraph.DiGraph.remove_edge
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - rng.random
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.suitable_edge
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.graph.Graph.remove_node
    - <builtin>.hasattr
    - d.popitem
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - <builtin>.iter
    - networkx.generators.degree_seq.DegreeSequenceRandomGraph.q
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.combinations
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7348e52880>
    argNames:
    - self
    - u
    - v
    - aux_graph
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 807
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 5
    functionsReached:
    - networkx.classes.graph.Graph.remove_node
    - d.popitem
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.remove_edge
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 825
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.p
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 829
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.q
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 4
    functionsReached:
    - <builtin>.max
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 834
    functionName: networkx.generators.degree_seq.DegreeSequenceRandomGraph.suitable_edge
    functionSourceFile: networkx.generators.degree_seq
    functionUses: 3
    functionsReached:
    - <builtin>.iter
    - <builtin>.next
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rem_deg.values
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: remaining_deg.keys
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rng.sample
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rng.random
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rng.choice
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.triads
    functionSourceFile: networkx.generators.triads
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - triad_name
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 38
    functionName: networkx.generators.triads.triad_graph
    functionSourceFile: networkx.generators.triads
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - d.items
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.trees
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 7
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - paths
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 50
    functionName: networkx.generators.trees.prefix_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - stack.append
    - collections.defaultdict
    - attr_dict.update
    - networkx.generators.trees.prefix_tree.get_children
    - datadict.update
    - collections.defaultdict.items
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - stack.pop
    - <builtin>.iter
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - parent
    - paths
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 141
    functionName: networkx.generators.trees.prefix_tree.get_children
    functionSourceFile: networkx.generators.trees
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - paths
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 183
    functionName: networkx.generators.trees.prefix_tree_recursive
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - attr_dict.update
    - datadict.update
    - collections.defaultdict.items
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.generators.trees.prefix_tree_recursive._helper
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 6
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - paths
    - root
    - tree
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 277
    functionName: networkx.generators.trees.prefix_tree_recursive._helper
    functionSourceFile: networkx.generators.trees
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - attr_dict.update
    - datadict.update
    - collections.defaultdict.items
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.generators.trees.prefix_tree_recursive._helper
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 326
    functionName: networkx.generators.trees.random_labeled_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - seed.choice
    - networkx.from_prufer_sequence
    - networkx.empty_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.from_prufer_sequence
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 380
    functionName: networkx.generators.trees.random_labeled_rooted_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.choice
    - networkx.generators.trees.random_labeled_tree
    - seed.randint
    - networkx.empty_graph
    - networkx.from_prufer_sequence
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.randint
    functionSourceFile: <builtin>
    functionUses: 16
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 417
    functionName: networkx.generators.trees.random_labeled_rooted_forest
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.generators.trees.random_labeled_rooted_forest._select_k
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - seed.sample
    - networkx._clear_cache
    - keydict.get
    - <builtin>.iter
    - <builtin>.len
    - <builtin>.set
    - math.factorial
    - seed.randint
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - collections.Counter
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 449
    functionName: networkx.generators.trees.random_labeled_rooted_forest._select_k
    functionSourceFile: networkx.generators.trees
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - math.factorial
    - seed.randint
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.factorial
    functionSourceFile: math
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5e1e80>
    - <ast.Constant object at 0x7f734b5e1ee0>
    argNames:
    - edges
    - n_nodes
    - root
    - roots
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 499
    functionName: networkx.generators.trees._to_nx
    functionSourceFile: networkx.generators.trees
    functionUses: 3
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - cache_trees
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 531
    functionName: networkx.generators.trees._num_rooted_trees
    functionSourceFile: networkx.generators.trees
    functionUses: 9
    functionsReached:
    - cache_trees.append
    - <builtin>.len
    - <builtin>.range
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache_trees.append
    functionSourceFile: <builtin>
    functionUses: 10
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - cache_trees
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 563
    functionName: networkx.generators.trees._select_jd_trees
    functionSourceFile: networkx.generators.trees
    functionUses: 7
    functionsReached:
    - <builtin>.range
    - <builtin>.sum
    - <builtin>.len
    - seed.randint
    - networkx.generators.trees._num_rooted_trees
    - cache_trees.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - cache_trees
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 604
    functionName: networkx.generators.trees._random_unlabeled_rooted_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 6
    functionsReached:
    - cache_trees.append
    - <builtin>.range
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - <builtin>.sum
    - <builtin>.len
    - networkx.generators.trees._select_jd_trees
    - seed.randint
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: t1.extend
    functionSourceFile: <builtin>
    functionUses: 7
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - number_of_trees
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 655
    functionName: networkx.generators.trees.random_unlabeled_rooted_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - keydict.get
    - <builtin>.sum
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.generators.trees._to_nx
    - <builtin>.len
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - networkx.generators.trees._select_jd_trees
    - seed.randint
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - cache_trees.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - q
    - cache_forests
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 710
    functionName: networkx.generators.trees._num_rooted_forests
    functionSourceFile: networkx.generators.trees
    functionUses: 5
    functionsReached:
    - <builtin>.range
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.len
    - cache_forests.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cache_forests.append
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - n
    - q
    - cache_forests
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 755
    functionName: networkx.generators.trees._select_jd_forests
    functionSourceFile: networkx.generators.trees
    functionUses: 4
    functionsReached:
    - <builtin>.range
    - networkx.generators.trees._num_rooted_forests
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.len
    - cache_forests.append
    - seed.randint
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 5
    argDefaultValues: []
    argNames:
    - n
    - q
    - cache_trees
    - cache_forests
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 794
    functionName: networkx.generators.trees._random_unlabeled_rooted_forest
    functionSourceFile: networkx.generators.trees
    functionUses: 3
    functionsReached:
    - cache_trees.append
    - <builtin>.range
    - networkx.generators.trees._num_rooted_forests
    - networkx.generators.trees._select_jd_forests
    - r1.append
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - networkx.generators.trees._random_unlabeled_rooted_forest
    - <builtin>.min
    - <builtin>.sum
    - <builtin>.len
    - networkx.generators.trees._select_jd_trees
    - cache_forests.append
    - seed.randint
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: r1.append
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues: []
    argNames:
    - n
    - q
    - number_of_forests
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 840
    functionName: networkx.generators.trees.random_unlabeled_rooted_forest
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - networkx.generators.trees._num_rooted_forests
    - r1.append
    - networkx.generators.trees._random_unlabeled_rooted_forest
    - keydict.get
    - <builtin>.sum
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.generators.trees._to_nx
    - res.append
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.generators.trees._select_jd_forests
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - networkx.generators.trees._select_jd_trees
    - cache_forests.append
    - seed.randint
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.min
    - networkx.empty_graph
    - cache_trees.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: res.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - cache_trees
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 910
    functionName: networkx.generators.trees._num_trees
    functionSourceFile: networkx.generators.trees
    functionUses: 2
    functionsReached:
    - <builtin>.range
    - <builtin>.sum
    - math.comb
    - <builtin>.len
    - networkx.generators.trees._num_rooted_trees
    - cache_trees.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - cache
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 938
    functionName: networkx.generators.trees._bicenter
    functionSourceFile: networkx.generators.trees
    functionUses: 2
    functionsReached:
    - cache_trees.append
    - <builtin>.range
    - t.append
    - t.extend
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - <builtin>.sum
    - <builtin>.len
    - networkx.generators.trees._select_jd_trees
    - seed.randint
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: t.extend
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: t.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues: []
    argNames:
    - n
    - cache_trees
    - cache_forests
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 973
    functionName: networkx.generators.trees._random_unlabeled_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 1
    functionsReached:
    - t.append
    - networkx.generators.trees._num_rooted_forests
    - r1.append
    - networkx.generators.trees._random_unlabeled_rooted_forest
    - <builtin>.sum
    - math.comb
    - networkx.generators.trees._num_trees
    - <builtin>.len
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    - networkx.generators.trees._select_jd_forests
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - networkx.generators.trees._select_jd_trees
    - cache_forests.append
    - seed.randint
    - <builtin>.range
    - f.append
    - t.extend
    - <builtin>.min
    - cache_trees.append
    - networkx.generators.trees._bicenter
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: f.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - number_of_trees
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1017
    functionName: networkx.generators.trees.random_unlabeled_tree
    functionSourceFile: networkx.generators.trees
    functionUses: 0
    functionsReached:
    - t.append
    - networkx.generators.trees._num_rooted_forests
    - networkx.generators.trees._random_unlabeled_tree
    - r1.append
    - networkx.generators.trees._random_unlabeled_rooted_forest
    - keydict.get
    - <builtin>.sum
    - math.comb
    - networkx.generators.trees._num_trees
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.generators.trees._to_nx
    - <builtin>.len
    - networkx.generators.trees._num_rooted_trees
    - t1.extend
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.generators.trees._select_jd_forests
    - networkx.generators.trees._random_unlabeled_rooted_tree
    - networkx.generators.trees._select_jd_trees
    - cache_forests.append
    - seed.randint
    - <builtin>.range
    - f.append
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - t.extend
    - <builtin>.min
    - networkx.empty_graph
    - cache_trees.append
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.generators.trees._bicenter
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.sudoku
    functionSourceFile: networkx.generators.sudoku
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba910>
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 51
    functionName: networkx.generators.sudoku.sudoku_graph
    functionSourceFile: networkx.generators.sudoku
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.random_clustered
    functionSourceFile: networkx.generators.random_clustered
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 7
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcb5e0>
    - <ast.Constant object at 0x7f734cfcb5b0>
    argNames:
    - joint_degree_sequence
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 11
    functionName: networkx.generators.random_clustered.random_clustered_graph
    functionSourceFile: networkx.generators.random_clustered
    functionUses: 0
    functionsReached:
    - keydict.get
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - ilist.pop
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - ilist.append
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - tlist.pop
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - tlist.append
    - seed.shuffle
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ilist.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tlist.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ilist.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: tlist.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.duplication
    functionSourceFile: networkx.generators.duplication
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24280>
    argNames:
    - N
    - n
    - p
    - q
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 19
    functionName: networkx.generators.duplication.partial_duplication_graph
    functionSourceFile: networkx.generators.duplication
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.complete_graph
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.all_neighbors
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - G.is_directed
    - attr_dict.update
    - <builtin>.list
    - seed.randint
    - G.is_multigraph
    - <builtin>.isinstance
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 5
    IfCount: 4
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba970>
    argNames:
    - n
    - p
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 99
    functionName: networkx.generators.duplication.duplication_divergence_graph
    functionSourceFile: networkx.generators.duplication
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - <builtin>.set
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - G.is_directed
    - networkx.classes.graph.Graph.remove_node
    - attr_dict.update
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - G.is_multigraph
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - seed.choice
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.random_graphs
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f7343709580>
    - <ast.Constant object at 0x7f7343709550>
    argNames:
    - n
    - p
    - seed
    - directed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 43
    functionName: networkx.generators.random_graphs.fast_gnp_random_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - seed.random
    - networkx.gnp_random_graph
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - ddd.update
    - networkx.classes.graph.Graph.is_directed
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.empty_graph
    - networkx.classes.graph.Graph.__init__
    - G.is_directed
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.gnp_random_graph
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cae7b80>
    - <ast.Constant object at 0x7f734cae70a0>
    argNames:
    - n
    - p
    - seed
    - directed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 124
    functionName: networkx.generators.random_graphs.gnp_random_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - seed.random
    - itertools.permutations
    - keydict.get
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - G.is_directed
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4d8f40>
    argNames:
    - n
    - m
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 193
    functionName: networkx.generators.random_graphs.dense_gnm_random_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - itertools.permutations
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - seed.randrange
    - G.is_directed
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.randrange
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c49a0>
    - <ast.Constant object at 0x7f734b5c4d60>
    argNames:
    - n
    - m
    - seed
    - directed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 258
    functionName: networkx.generators.random_graphs.gnm_random_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - collections.abc.Mapping.attr.items
    - d.items
    - itertools.permutations
    - keydict.get
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.graph.Graph.__init__
    - G.is_directed
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - datadict.items
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - seed.choice
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd27730>
    argNames:
    - n
    - k
    - p
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 315
    functionName: networkx.generators.random_graphs.newman_watts_strogatz_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.has_edge
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - seed.choice
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - networkx.complete_graph
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - N.graph.update
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd41bb0>
    argNames:
    - n
    - k
    - p
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 390
    functionName: networkx.generators.random_graphs.watts_strogatz_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - seed.random
    - networkx.complete_graph
    - <builtin>.zip
    - networkx.classes.reportviews.DiDegreeView.__init__
    - keydict.get
    - networkx.classes.digraph.DiGraph.remove_edge
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - G.is_multigraph
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcb5b0>
    - <ast.Constant object at 0x7f734cfcb250>
    argNames:
    - n
    - k
    - p
    - tries
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 470
    functionName: networkx.generators.random_graphs.connected_watts_strogatz_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.complete_graph
    - <builtin>.zip
    - networkx.classes.reportviews.DiDegreeView.__init__
    - keydict.get
    - networkx.classes.digraph.DiGraph.remove_edge
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.is_connected
    - networkx.classes.multigraph.MultiGraph.degree
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - G.is_multigraph
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.generators.random_graphs.watts_strogatz_graph
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6a8cd0>
    argNames:
    - d
    - n
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 526
    functionName: networkx.generators.random_graphs.random_regular_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - collections.defaultdict.items
    - keydict.get
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.generators.random_graphs.random_regular_graph._try_creation
    - G.is_directed
    - networkx.generators.random_graphs.random_regular_graph._suitable
    - <builtin>.list
    - <builtin>.iter
    - G.is_multigraph
    - <builtin>.isinstance
    - seed.shuffle
    - collections.defaultdict
    - edges.add
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 0
    IfCount: 4
    argCount: 2
    argDefaultValues: []
    argNames:
    - edges
    - potential_edges
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 585
    functionName: networkx.generators.random_graphs.random_regular_graph._suitable
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 604
    functionName: networkx.generators.random_graphs.random_regular_graph._try_creation
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - collections.defaultdict
    - edges.add
    - <builtin>.range
    - networkx.generators.random_graphs.random_regular_graph._suitable
    - collections.defaultdict.items
    - <builtin>.zip
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.set
    - seed.shuffle
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.generators.random_graphs.random_regular_graph._try_creation.<lambda1>
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - seq
    - m
    - rng
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 644
    functionName: networkx.generators.random_graphs._random_subset
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 4
    functionsReached:
    - <builtin>.len
    - <builtin>.set
    - rng.choice
    - targets.add
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: targets.add
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65eaf0>
    - <ast.Constant object at 0x7f734a65eac0>
    argNames:
    - n
    - m
    - seed
    - initial_graph
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 661
    functionName: networkx.generators.random_graphs.barabasi_albert_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - <builtin>.zip
    - targets.add
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - networkx.generators.classic.star_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - nodes.append
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - initial_graph.copy
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - repeated_nodes.extend
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.generators.random_graphs._random_subset
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - rng.choice
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - N.graph.update
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: initial_graph.copy
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: repeated_nodes.extend
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 4
    IfCount: 8
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f7343726100>
    - <ast.Constant object at 0x7f73437260d0>
    argNames:
    - n
    - m1
    - m2
    - p
    - seed
    - initial_graph
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 737
    functionName: networkx.generators.random_graphs.dual_barabasi_albert_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.zip
    - targets.add
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - networkx.generators.classic.star_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - nodes.append
    - datadict.update
    - ddd.update
    - <builtin>.max
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - attr.copy
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - initial_graph.copy
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - repeated_nodes.extend
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.generators.random_graphs._random_subset
    - networkx.classes.reportviews.DiDegreeView.__init__
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - rng.choice
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.generators.random_graphs.barabasi_albert_graph
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 19
    IfCount: 10
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f7343715100>
    argNames:
    - n
    - m
    - p
    - q
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 842
    functionName: networkx.generators.random_graphs.extended_barabasi_albert_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - nbr_nodes.append
    - <builtin>.zip
    - targets.add
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.graph.Graph.size
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - attachment_preference.remove
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - networkx.classes.digraph.DiGraph.remove_edge
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - attachment_preference.append
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - eligible_nodes.append
    - G.is_directed
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - attachment_preference.extend
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.generators.random_graphs._random_subset
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - eligible_nodes.remove
    - <builtin>.range
    - seed.choice
    - prohibited_nodes.append
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - datadict.items
    - networkx.empty_graph
    - rng.choice
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.graph.Graph.__init__
    - d.popitem
    - <builtin>.list
    - d.items
    - N.graph.update
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attachment_preference.extend
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: prohibited_nodes.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attachment_preference.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: eligible_nodes.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: nbr_nodes.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attachment_preference.remove
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: eligible_nodes.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 8
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734346b040>
    argNames:
    - n
    - m
    - p
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 1008
    functionName: networkx.generators.random_graphs.powerlaw_cluster_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - targets.add
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.has_edge
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - repeated_nodes.append
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - repeated_nodes.extend
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.generators.random_graphs._random_subset
    - newdict.update
    - possible_targets.pop
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - seed.choice
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - rng.choice
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - N.graph.update
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: possible_targets.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: repeated_nodes.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734345c790>
    argNames:
    - n
    - p1
    - p2
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 1101
    functionName: networkx.generators.random_graphs.random_lobster_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - seed.random
    - <builtin>.zip
    - nbrs.items
    - networkx.generators.classic.path_graph
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keylist.append
    - <builtin>.abs
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - newdict.update
    - itertools.pairwise
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - d.items
    - N.graph.update
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734343e0d0>
    argNames:
    - n
    - p1
    - p2
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 10
    functionLinenumber: 1156
    functionName: networkx.generators.random_graphs.random_lobster
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.zip
    - nbrs.items
    - networkx.generators.classic.path_graph
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keylist.append
    - <builtin>.abs
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - newdict.update
    - warnings.warn
    - itertools.pairwise
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.digraph.DiGraph.__init__
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - d.items
    - N.graph.update
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.generators.random_graphs.random_lobster_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734343e940>
    argNames:
    - constructor
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 1175
    functionName: networkx.generators.random_graphs.random_shell_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.convert.from_dict_of_lists
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.has_edge
    - attr.pop
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - intra_edges.append
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - itertools.combinations
    - networkx.algorithms.operators.union
    - collections.abc.Mapping.attr.items
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - attr.copy
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.set
    - G.is_directed
    - <builtin>.hasattr
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    - networkx.convert_node_labels_to_integers
    - itertools.permutations
    - newdict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - glist.append
    - <builtin>.len
    - networkx.generators.classic.empty_graph
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.has_edge
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - seed.choice
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - datadict.items
    - networkx.generators.random_graphs.gnm_random_graph
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutEdgeView.__init__
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.utils.misc.check_create_using
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.graph.Graph.__init__
    - d.items
    - <builtin>.list
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - collections.abc.Mapping.clear
    - result.graph.update
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: intra_edges.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.operators.union
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f73445e4b20>
    - <ast.Constant object at 0x7f73445e4b50>
    - <ast.Constant object at 0x7f73445e4b80>
    argNames:
    - n
    - gamma
    - seed
    - tries
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 1238
    functionName: networkx.generators.random_graphs.random_powerlaw_tree
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - deg.pop
    - networkx.utils.powerlaw_sequence
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - keylist.append
    - swap.pop
    - networkx.generators.degree_seq.degree_sequence_tree
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.utils.is_valid_tree_degree_sequence
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - networkx.classes.graph.Graph.is_directed
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - G.is_directed
    - attr_dict.update
    - networkx.generators.random_graphs.random_powerlaw_tree_sequence
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - G.is_multigraph
    - seed.randint
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - networkx.add_path
    - <builtin>.range
    - <builtin>.round
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.min
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73445e0520>
    - <ast.Constant object at 0x7f73445e0550>
    - <ast.Constant object at 0x7f73445e0580>
    argNames:
    - n
    - gamma
    - seed
    - tries
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1279
    functionName: networkx.generators.random_graphs.random_powerlaw_tree_sequence
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - networkx.utils.is_valid_tree_degree_sequence
    - <builtin>.round
    - <builtin>.max
    - networkx.utils.powerlaw_sequence
    - <builtin>.min
    - seed.randint
    - swap.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.powerlaw_sequence
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: swap.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f73445dbbb0>
    - <ast.Constant object at 0x7f73445dbbe0>
    argNames:
    - n
    - kernel_integral
    - kernel_root
    - seed
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 1332
    functionName: networkx.generators.random_graphs.random_kernel_graph
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached:
    - seed.random
    - attr.copy
    - keydict.get
    - newdict.update
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.utils.misc.check_create_using
    - <builtin>.len
    - scipy.optimize.brentq
    - G.is_directed
    - networkx.empty_graph
    - <builtin>.iter
    - G.is_multigraph
    - <builtin>.isinstance
    - math.ceil
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - networkx.generators.random_graphs.random_kernel_graph.kernel_root
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - y
    - a
    - r
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1400
    functionName: networkx.generators.random_graphs.random_kernel_graph.kernel_root
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 1
    functionsReached:
    - scipy.optimize.brentq
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - b
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 1401
    functionName: networkx.generators.random_graphs.random_kernel_graph.kernel_root.my_function
    functionSourceFile: networkx.generators.random_graphs
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.optimize.brentq
    functionSourceFile: scipy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.cographs
    functionSourceFile: networkx.generators.cographs
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734c448a00>
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 23
    functionName: networkx.generators.cographs.random_cograph
    functionSourceFile: networkx.generators.cographs
    functionUses: 0
    functionsReached:
    - G.graph.update
    - G.__class__
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - nbrs.items
    - keydict.items
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - G.add_edges_from
    - collections.abc.Mapping.keys
    - networkx.classes.graph.Graph.is_directed
    - G.add_nodes_from
    - <builtin>.len
    - <builtin>.set
    - networkx.relabel_nodes
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.full_join
    - seed.randint
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - d.copy
    - collections.abc.Mapping.items
    - <builtin>.range
    - datadict.copy
    - networkx.freeze
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graphviews.generic_graph_view
    - <builtin>.super
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.disjoint_union
    - networkx.empty_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.generators.cographs.random_cograph.<lambda1>
    functionSourceFile: networkx.generators.cographs
    functionUses: 0
    functionsReached:
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.full_join
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.disjoint_union
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.spectral_graph_forge
    functionSourceFile: networkx.generators.spectral_graph_forge
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.utils.decorators.np_random_state
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a9ed4c0>
    - <ast.Constant object at 0x7f734a9ed1c0>
    argNames:
    - G
    - alpha
    - transformation
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.generators.spectral_graph_forge.spectral_graph_forge
    functionSourceFile: networkx.generators.spectral_graph_forge
    functionUses: 0
    functionsReached:
    - numpy.ones
    - numpy.clip
    - <builtin>.range
    - K.sum
    - <builtin>.round
    - numpy.diag
    - numpy.abs
    - numpy.transpose
    - numpy.fill_diagonal
    - numpy.argsort
    - networkx.from_numpy_array
    - numpy.linalg.eigh
    - scipy.stats.bernoulli.rvs
    - numpy.arange
    - networkx.to_numpy_array
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: K.sum
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.stats.bernoulli.rvs
    functionSourceFile: scipy
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.stochastic
    functionSourceFile: networkx.generators.stochastic
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0ff10>
    - <ast.Constant object at 0x7f734cd0fe20>
    argNames:
    - G
    - copy
    - weight
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 17
    functionName: networkx.generators.stochastic.stochastic_graph
    functionSourceFile: networkx.generators.stochastic
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - newdict.update
    - keydict.get
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - <builtin>.set
    - networkx.classes.digraph.DiGraph.__init__
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.hasattr
    - networkx.classes.reportviews.NodeView.__iter__
    - attr_dict.update
    - G.out_degree
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - d.items
    - attr.pop
    - datadict.items
    - G.is_multigraph
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - G.edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.line
    functionSourceFile: networkx.generators.line
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73452b3160>
    argNames:
    - G
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 15
    functionName: networkx.generators.line.line_graph
    functionSourceFile: networkx.generators.line
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.generators.line._lg_directed
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - functools.partial
    - G.is_directed
    - attr_dict.update
    - networkx.generators.line._lg_undirected
    - <builtin>.tuple
    - G.is_multigraph
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb32760>
    argNames:
    - G
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 123
    functionName: networkx.generators.line._lg_directed
    functionSourceFile: networkx.generators.line
    functionUses: 1
    functionsReached:
    - attr_dict.update
    - networkx.classes.graph.Graph.add_node
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - G.is_multigraph
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - functools.partial
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e1f0>
    - <ast.Constant object at 0x7f734b66e790>
    argNames:
    - G
    - selfloops
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 153
    functionName: networkx.generators.line._lg_undirected
    functionSourceFile: networkx.generators.line
    functionUses: 1
    functionsReached:
    - <builtin>.sorted
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.enumerate
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - edges.update
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - functools.partial
    - attr_dict.update
    - <builtin>.tuple
    - G.is_multigraph
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edge
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 189
    functionName: networkx.generators.line._lg_undirected.edge_key_function
    functionSourceFile: networkx.generators.line
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 4
    IfCount: 6
    argCount: 1
    argDefaultValues: []
    argNames:
    - G
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 221
    functionName: networkx.generators.line.inverse_line_graph
    functionSourceFile: networkx.generators.line
    functionUses: 0
    functionsReached:
    - G.number_of_nodes
    - attr.copy
    - keydict.get
    - G.number_of_edges
    - newdict.update
    - partitioned_vertices.pop
    - G_partition.number_of_edges
    - P.append
    - networkx.generators.line._triangles
    - triangle_nodes.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.any
    - networkx.generators.line._select_starting_cell
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.line._find_partition
    - <builtin>.next
    - P_count.values
    - networkx.generators.line._odd_triangle
    - <builtin>.tuple
    - <builtin>.list
    - <builtin>.iter
    - networkx.empty_graph
    - networkx.number_of_selfloops
    - <builtin>.isinstance
    - triangle_list.append
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - collections.defaultdict
    - G_partition.remove_edges_from
    - networkx.utils.arbitrary_element
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - G.nodes
    - odd_triangles.append
    - itertools.combinations
    - G.copy
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 3
    IfCount: 11
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cfa90>
    argNames:
    - G
    - starting_edge
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 413
    functionName: networkx.generators.line._select_starting_cell
    functionSourceFile: networkx.generators.line
    functionUses: 1
    functionsReached:
    - networkx.generators.line._triangles
    - triangle_nodes.add
    - <builtin>.any
    - networkx.generators.line._select_starting_cell
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - networkx.generators.line._odd_triangle
    - <builtin>.tuple
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - triangle_list.append
    - G.edges
    - networkx.utils.misc.arbitrary_element
    - collections.defaultdict
    - networkx.utils.arbitrary_element
    - G.nodes
    - odd_triangles.append
    - itertools.combinations
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - starting_cell
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 368
    functionName: networkx.generators.line._find_partition
    functionSourceFile: networkx.generators.line
    functionUses: 1
    functionsReached:
    - G_partition.remove_edges_from
    - <builtin>.tuple
    - <builtin>.list
    - partitioned_vertices.pop
    - G.copy
    - <builtin>.len
    - G_partition.number_of_edges
    - itertools.combinations
    - P.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P_count.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - e
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 314
    functionName: networkx.generators.line._triangles
    functionSourceFile: networkx.generators.line
    functionUses: 2
    functionsReached:
    - triangle_list.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: triangle_list.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - G
    - T
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 328
    functionName: networkx.generators.line._odd_triangle
    functionSourceFile: networkx.generators.line
    functionUses: 2
    functionsReached:
    - collections.defaultdict
    - G.nodes
    - <builtin>.list
    - itertools.combinations
    - <builtin>.any
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_partition.remove_edges_from
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: G_partition.number_of_edges
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: partitioned_vertices.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: P.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: odd_triangles.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: triangle_nodes.add
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.atlas
    functionSourceFile: networkx.generators.atlas
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - importlib.resources.files
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.resources.files
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 56
    functionName: networkx.generators.atlas._generate_graphs
    functionSourceFile: networkx.generators.atlas
    functionUses: 2
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - <builtin>.map
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - line.startswith
    - e.split
    - <builtin>.int
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - f.readline
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - gzip.open
    - <builtin>.tuple
    - <builtin>.iter
    - line.rstrip
    - edgelist.append
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: gzip.open
    functionSourceFile: gzip
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: f.readline
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: edgelist.append
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: e.split
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - i
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 91
    functionName: networkx.generators.atlas.graph_atlas
    functionSourceFile: networkx.generators.atlas
    functionUses: 0
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - itertools.islice
    - keylist.append
    - <builtin>.map
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - line.startswith
    - e.split
    - <builtin>.int
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - f.readline
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - gzip.open
    - <builtin>.tuple
    - <builtin>.iter
    - line.rstrip
    - edgelist.append
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.generators.atlas._generate_graphs
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 130
    functionName: networkx.generators.atlas.graph_atlas_g
    functionSourceFile: networkx.generators.atlas
    functionUses: 0
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - keylist.append
    - <builtin>.map
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - line.startswith
    - e.split
    - <builtin>.int
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - f.readline
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - gzip.open
    - <builtin>.tuple
    - <builtin>.list
    - <builtin>.iter
    - line.rstrip
    - edgelist.append
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.generators.atlas._generate_graphs
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.small
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - functools.wraps
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - networkx.generators.small._raise_on_directed
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - func
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 45
    functionName: networkx.generators.small._raise_on_directed
    functionSourceFile: networkx.generators.small
    functionUses: 1
    functionsReached:
    - functools.wraps
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: functools.wraps
    functionSourceFile: functools
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 55
    functionName: networkx.generators.small._raise_on_directed.wrapper
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.defaultdict
    - kwargs.get
    - math.inf
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.inf
    functionSourceFile: math
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7342c1a4c0>
    argNames:
    - n
    - shift_list
    - repeats
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 67
    functionName: networkx.generators.small.LCF_graph
    functionSourceFile: networkx.generators.small
    functionUses: 5
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - itertools.tee
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd0fa90>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 149
    functionName: networkx.generators.small.bull_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.from_dict_of_lists
    functionSourceFile: ''
    functionUses: 12
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55d60>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 183
    functionName: networkx.generators.small.chvatal_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd48460>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 228
    functionName: networkx.generators.small.cubical_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65ec10>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 275
    functionName: networkx.generators.small.desargues_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.generators.small.LCF_graph
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e400>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 306
    functionName: networkx.generators.small.diamond_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734d611430>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 335
    functionName: networkx.generators.small.dodecahedral_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.generators.small.LCF_graph
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90a60>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 370
    functionName: networkx.generators.small.frucht_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - networkx.convert.to_networkx_graph
    - newdict.update
    - keydict.get
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - <builtin>.isinstance
    - networkx.generators.classic.cycle_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - itertools.tee
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc23a30>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 417
    functionName: networkx.generators.small.heawood_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.generators.small.LCF_graph
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 6
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 451
    functionName: networkx.generators.small.hoffman_singleton_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.convert_node_labels_to_integers
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734d63daf0>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 495
    functionName: networkx.generators.small.house_graph
    functionSourceFile: networkx.generators.small
    functionUses: 1
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77a460>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 526
    functionName: networkx.generators.small.house_x_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.generators.small.house_graph
    - networkx.from_dict_of_lists
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - keylist.append
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734d5ebc40>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 556
    functionName: networkx.generators.small.icosahedral_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734cb61310>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 603
    functionName: networkx.generators.small.krackhardt_kite_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd241f0>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 653
    functionName: networkx.generators.small.moebius_kantor_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.generators.small.LCF_graph
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734d38c6d0>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 683
    functionName: networkx.generators.small.octahedral_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 722
    functionName: networkx.generators.small.pappus_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.sorted
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.generators.classic.cycle_graph
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.generators.small.LCF_graph
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - <builtin>.dict
    - itertools.tee
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.from_pandas_edgelist
    - networkx.classes.reportviews.NodeView.__init__
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f734c3fb3a0>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 746
    functionName: networkx.generators.small.petersen_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - n
    - k
    - create_using
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 790
    functionName: networkx.generators.small.generalized_petersen_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - keydict.get
    - networkx.classes.graph.Graph.is_directed
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.cycle_graph
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - NetworkXError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.cycle_graph
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 6
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f7342c35d00>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 843
    functionName: networkx.generators.small.sedgewick_maze_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.convert.to_networkx_graph
    - newdict.update
    - nbrs.items
    - networkx.from_numpy_array
    - <builtin>.str
    - keydict.get
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - <builtin>.isinstance
    - N.graph.update
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f7342c15220>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 876
    functionName: networkx.generators.small.tetrahedral_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - itertools.permutations
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - nbrs.items
    - keylist.append
    - <builtin>.str
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - networkx.generators.classic.complete_graph
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - itertools.combinations
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f7342c12cd0>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 910
    functionName: networkx.generators.small.truncated_cube_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f7342c0f790>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 968
    functionName: networkx.generators.small.truncated_tetrahedron_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - attr.copy
    - nbrs.items
    - networkx.generators.classic.path_graph
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.from_numpy_array
    - keydict.get
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - networkx.utils.misc.pairwise
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - itertools.pairwise
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - itertools.chain
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - networkx.empty_graph
    - d.items
    - <builtin>.isinstance
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - N.graph.update
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.clear
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - itertools.tee
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues:
    - <ast.Constant object at 0x7f7342c37310>
    argNames:
    - create_using
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 999
    functionName: networkx.generators.small.tutte_graph
    functionSourceFile: networkx.generators.small
    functionUses: 0
    functionsReached:
    - networkx.from_dict_of_lists
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.community
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - l
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 24
    functionName: networkx.generators.community.caveman_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - itertools.combinations
    - keylist.append
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - l
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 71
    functionName: networkx.generators.community.connected_caveman_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - d.popitem
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - networkx.classes.digraph.DiGraph.remove_edge
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.caveman_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.caveman_graph
    functionSourceFile: ''
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f73486bc3d0>
    argNames:
    - l
    - k
    - p
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 126
    functionName: networkx.generators.community.relaxed_caveman_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - keydict.get
    - nbrs.items
    - networkx.classes.digraph.DiGraph.remove_edge
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.classes.graph.Graph.has_edge
    - <builtin>.hasattr
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.has_edge
    - <builtin>.list
    - networkx.caveman_graph
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - seed.choice
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e7c70>
    - <ast.Constant object at 0x7f734b6e7670>
    argNames:
    - sizes
    - p_in
    - p_out
    - seed
    - directed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 178
    functionName: networkx.generators.community.random_partition_graph
    functionSourceFile: networkx.generators.community
    functionUses: 2
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - itertools.permutations
    - <builtin>.sum
    - keydict.get
    - <builtin>.enumerate
    - itertools.islice
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.combinations_with_replacement
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - itertools.chain
    - attr_dict.update
    - <builtin>.list
    - itertools.product
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - networkx.generators.community.stochastic_block_model
    - itertools.combinations
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 18
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 10
    EdgeCount: 26
    ICount: 7
    IfCount: 18
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734b9e1c70>
    - <ast.Constant object at 0x7f734b9e1f40>
    - <ast.Constant object at 0x7f734b9e1790>
    - <ast.Constant object at 0x7f734b9e1ca0>
    - <ast.Constant object at 0x7f734b9e16a0>
    argNames:
    - sizes
    - p
    - nodelist
    - seed
    - directed
    - selfloops
    - sparse
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 499
    functionName: networkx.generators.community.stochastic_block_model
    functionSourceFile: networkx.generators.community
    functionUses: 3
    functionsReached:
    - seed.random
    - <builtin>.zip
    - itertools.permutations
    - networkx.classes.digraph.DiGraph.add_node
    - <builtin>.sum
    - keydict.get
    - <builtin>.enumerate
    - itertools.islice
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.combinations_with_replacement
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - itertools.chain
    - attr_dict.update
    - <builtin>.list
    - itertools.product
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - itertools.combinations
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfc7760>
    - <ast.Constant object at 0x7f734cfc7850>
    argNames:
    - l
    - k
    - p_in
    - p_out
    - seed
    - directed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 257
    functionName: networkx.generators.community.planted_partition_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - itertools.permutations
    - <builtin>.sum
    - keydict.get
    - <builtin>.enumerate
    - itertools.islice
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.combinations_with_replacement
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - itertools.chain
    - attr_dict.update
    - <builtin>.list
    - networkx.generators.community.random_partition_graph
    - itertools.product
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - networkx.generators.community.stochastic_block_model
    - itertools.combinations
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 3
    IfCount: 3
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3af0>
    - <ast.Constant object at 0x7f734d3a3430>
    argNames:
    - n
    - s
    - v
    - p_in
    - p_out
    - directed
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 313
    functionName: networkx.generators.community.gaussian_random_partition_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - seed.random
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - itertools.permutations
    - <builtin>.sum
    - keydict.get
    - <builtin>.enumerate
    - itertools.islice
    - seed.gauss
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - itertools.combinations_with_replacement
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - <builtin>.len
    - <builtin>.set
    - <builtin>.next
    - itertools.chain
    - attr_dict.update
    - <builtin>.list
    - networkx.generators.community.random_partition_graph
    - itertools.product
    - sizes.append
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - networkx.generators.community.stochastic_block_model
    - itertools.combinations
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.gauss
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: sizes.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - num_cliques
    - clique_size
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 389
    functionName: networkx.generators.community.ring_of_cliques
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - ddd.update
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - keydict.get
    - <builtin>.len
    - itertools.combinations
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - k
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 445
    functionName: networkx.generators.community.windmill_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.disjoint_union_all
    - G.add_edges_from
    - networkx.complete_graph
    - G.number_of_nodes
    - itertools.chain
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - gamma
    - xmin
    - threshold
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 665
    functionName: networkx.generators.community._zipf_rv_below
    functionSourceFile: networkx.generators.community
    functionUses: 2
    functionsReached:
    - networkx.utils.zipf_rv
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.utils.zipf_rv
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 7
    argDefaultValues: []
    argNames:
    - gamma
    - low
    - high
    - condition
    - length
    - max_iters
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 677
    functionName: networkx.generators.community._powerlaw_sequence
    functionSourceFile: networkx.generators.community
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - networkx.generators.community._zipf_rv_below
    - seq.append
    - networkx.generators.community.LFR_benchmark_graph.condition
    - <builtin>.sum
    - networkx.utils.zipf_rv
    - <builtin>.len
    - networkx.generators.community.LFR_benchmark_graph.length
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - seq
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1045
    functionName: networkx.generators.community.LFR_benchmark_graph.length
    functionSourceFile: networkx.generators.community
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seq.append
    functionSourceFile: <builtin>
    functionUses: 9
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - seq
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 1042
    functionName: networkx.generators.community.LFR_benchmark_graph.condition
    functionSourceFile: networkx.generators.community
    functionUses: 2
    functionsReached:
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - x
    - q
    - tolerance
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 708
    functionName: networkx.generators.community._hurwitz_zeta
    functionSourceFile: networkx.generators.community
    functionUses: 1
    functionsReached:
    - <builtin>.abs
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues: []
    argNames:
    - gamma
    - average_degree
    - max_degree
    - tolerance
    - max_iters
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 726
    functionName: networkx.generators.community._generate_min_degree
    functionSourceFile: networkx.generators.community
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.round
    - scipy.special.zeta
    - <builtin>.int
    - <builtin>.abs
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - x
    - q
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 733
    functionName: networkx.generators.community._generate_min_degree.zeta
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - <builtin>.abs
    - networkx.generators.community._hurwitz_zeta
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.special.zeta
    functionSourceFile: scipy
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 5
    argDefaultValues: []
    argNames:
    - degree_seq
    - community_sizes
    - mu
    - max_iters
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 758
    functionName: networkx.generators.community._generate_communities
    functionSourceFile: networkx.generators.community
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.round
    - seed.choice
    - free.pop
    - <builtin>.list
    - <builtin>.len
    - <builtin>.set
    - free.append
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: free.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: free.append
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 10
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 15
    ICount: 4
    IfCount: 10
    argCount: 12
    argDefaultValues:
    - <ast.Constant object at 0x7f73486a04f0>
    - <ast.Constant object at 0x7f73486a04c0>
    - <ast.Constant object at 0x7f73486a0490>
    - <ast.Constant object at 0x7f73486a0460>
    - <ast.Constant object at 0x7f73486a0430>
    - <ast.Constant object at 0x7f73486a0400>
    - <ast.Constant object at 0x7f73486a03d0>
    - <ast.Constant object at 0x7f73486a03a0>
    argNames:
    - n
    - tau1
    - tau2
    - mu
    - average_degree
    - min_degree
    - max_degree
    - min_community
    - max_community
    - tol
    - max_iters
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 811
    functionName: networkx.generators.community.LFR_benchmark_graph
    functionSourceFile: networkx.generators.community
    functionUses: 0
    functionsReached:
    - networkx.generators.community._generate_communities
    - scipy.special.zeta
    - networkx.classes.reportviews.DiDegreeView.__init__
    - attr.copy
    - keydict.get
    - <builtin>.sum
    - newdict.update
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.generators.community._zipf_rv_below
    - networkx.generators.community.LFR_benchmark_graph.condition
    - datadict.update
    - <builtin>.int
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.generators.community._powerlaw_sequence
    - free.append
    - networkx.generators.community._generate_min_degree
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.utils.zipf_rv
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - <builtin>.range
    - <builtin>.round
    - seq.append
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - <builtin>.min
    - free.pop
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.generators.community.LFR_benchmark_graph.length
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.joint_degree_seq
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 1
    argDefaultValues: []
    argNames:
    - joint_degrees
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 15
    functionName: networkx.generators.joint_degree_seq.is_valid_joint_degree
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 1
    functionsReached:
    - k_size.is_integer
    - <builtin>.float
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k_size.is_integer
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b77aa00>
    argNames:
    - G
    - w
    - unsat
    - h_node_residual
    - avoid_node_id
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 81
    functionName: networkx.generators.joint_degree_seq._neighbor_switch
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 1
    functionsReached:
    - d.popitem
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - unsat.remove
    - keydict.get
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.remove_edge
    - <builtin>.len
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - <builtin>.next
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unsat.remove
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 7
    IfCount: 9
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65efd0>
    argNames:
    - joint_degrees
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 146
    functionName: networkx.generators.joint_degree_seq.joint_degree_graph
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 0
    functionsReached:
    - networkx.generators.joint_degree_seq.is_valid_joint_degree
    - keydict.get
    - <builtin>.sum
    - networkx.classes.digraph.DiGraph.remove_edge
    - l.values
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - degree_count.items
    - <builtin>.next
    - networkx.classes.graph.Graph.has_edge
    - seed.randrange
    - d.popitem
    - networkx.classes.multigraph.MultiGraph.has_edge
    - k_unsat.discard
    - <builtin>.iter
    - <builtin>.float
    - joint_degrees.items
    - degree_count.values
    - <builtin>.range
    - k_size.is_integer
    - networkx.generators.joint_degree_seq._neighbor_switch
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - unsat.remove
    - l_unsat.discard
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: l.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: joint_degrees.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degree_count.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degree_count.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: k_unsat.discard
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: l_unsat.discard
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 1
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - in_degrees
    - out_degrees
    - nkk
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 289
    functionName: networkx.generators.joint_degree_seq.is_valid_directed_joint_degree
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - forbidden.get
    - S.get
    - <builtin>.len
    - <builtin>.float
    - <builtin>.all
    - V.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: V.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: forbidden.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: S.get
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 7
    argDefaultValues: []
    argNames:
    - G
    - w
    - unsat
    - h_node_residual_out
    - chords
    - h_partition_in
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 356
    functionName: networkx.generators.joint_degree_seq._directed_neighbor_switch
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 1
    functionsReached:
    - keydict.get
    - networkx.classes.digraph.DiGraph.remove_edge
    - chords.discard
    - unsat.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - unsat.pop
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - d.popitem
    - chords.add
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - unsat.remove
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unsat.pop
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: unsat.add
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: chords.discard
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 7
    IfCount: 3
    argCount: 7
    argDefaultValues: []
    argNames:
    - G
    - w
    - unsat
    - h_node_residual_in
    - chords
    - h_partition_out
    - partition
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 419
    functionName: networkx.generators.joint_degree_seq._directed_neighbor_switch_rev
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 1
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - keydict.get
    - networkx.classes.digraph.DiGraph.remove_edge
    - chords.discard
    - unsat.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - unsat.pop
    - <builtin>.len
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - d.popitem
    - chords.add
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - unsat.remove
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 16
    IfCount: 11
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbf2d90>
    argNames:
    - in_degrees
    - out_degrees
    - nkk
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 473
    functionName: networkx.generators.joint_degree_seq.directed_joint_degree_graph
    functionSourceFile: networkx.generators.joint_degree_seq
    functionUses: 0
    functionsReached:
    - networkx.classes.digraph.DiGraph.predecessors
    - seed.sample
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - networkx.classes.digraph.DiGraph.remove_edge
    - <builtin>.enumerate
    - h_degree_nodelist_out_unsat.setdefault
    - <builtin>.all
    - chords.discard
    - unsat.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - h_degree_nodelist_out.setdefault
    - networkx.generators.joint_degree_seq._directed_neighbor_switch
    - <builtin>.int
    - h_degree_nodelist_in_unsat.setdefault
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - datadict.update
    - chords.pop
    - unsat.pop
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - attr_dict.update
    - d.popitem
    - chords.add
    - k_unsat.discard
    - h_degree_nodelist_in.setdefault
    - <builtin>.list
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - S.get
    - forbidden.get
    - non_chords.get
    - <builtin>.float
    - networkx.generators.joint_degree_seq.is_valid_directed_joint_degree
    - networkx.generators.joint_degree_seq._directed_neighbor_switch_rev
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - unsat.remove
    - l_unsat.discard
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - V.get
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h_degree_nodelist_in.setdefault
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h_degree_nodelist_in_unsat.setdefault
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: non_chords.get
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h_degree_nodelist_out.setdefault
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: h_degree_nodelist_out_unsat.setdefault
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: chords.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.nonisomorphic_trees
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - functools.lru_cache
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - order
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 18
    functionName: networkx.generators.nonisomorphic_trees.nonisomorphic_trees
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 0
    functionsReached:
    - stack.append
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - networkx.generators.nonisomorphic_trees._layout_to_graph
    - stack.pop
    - keydict.get
    - <builtin>.len
    - <builtin>.list
    - networkx.generators.nonisomorphic_trees._next_tree
    - networkx.empty_graph
    - networkx.generators.nonisomorphic_trees._split_tree
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.generators.nonisomorphic_trees._next_rooted_tree
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 1
    IfCount: 5
    argCount: 1
    argDefaultValues: []
    argNames:
    - candidate
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 161
    functionName: networkx.generators.nonisomorphic_trees._next_tree
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - <builtin>.max
    - <builtin>.list
    - <builtin>.len
    - networkx.generators.nonisomorphic_trees._split_tree
    - networkx.generators.nonisomorphic_trees._next_rooted_tree
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - layout
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 243
    functionName: networkx.generators.nonisomorphic_trees._layout_to_graph
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 1
    functionsReached:
    - stack.append
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - stack.pop
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b6e70d0>
    argNames:
    - predecessor
    - p
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 142
    functionName: networkx.generators.nonisomorphic_trees._next_rooted_tree
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - <builtin>.range
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - order
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 81
    functionName: networkx.generators.nonisomorphic_trees.number_of_nonisomorphic_trees
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 0
    functionsReached:
    - networkx.generators.nonisomorphic_trees._rooted_trees
    - <builtin>.range
    - networkx.generators.nonisomorphic_trees._unlabeled_trees
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 117
    functionName: networkx.generators.nonisomorphic_trees._unlabeled_trees
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 1
    functionsReached:
    - networkx.generators.nonisomorphic_trees._rooted_trees
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - n
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 129
    functionName: networkx.generators.nonisomorphic_trees._rooted_trees
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 2
    functionsReached:
    - networkx.generators.nonisomorphic_trees._rooted_trees
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - layout
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 200
    functionName: networkx.generators.nonisomorphic_trees._split_tree
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 2
    functionsReached:
    - <builtin>.len
    - <builtin>.range
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - layout
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 223
    functionName: networkx.generators.nonisomorphic_trees._layout_to_matrix
    functionSourceFile: networkx.generators.nonisomorphic_trees
    functionUses: 0
    functionsReached:
    - stack.append
    - <builtin>.len
    - <builtin>.range
    - stack.pop
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.directed
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.utils.decorators.np_random_state
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7345b5c160>
    - <ast.Constant object at 0x7f7345b5c130>
    - <ast.Constant object at 0x7f7345b5c100>
    argNames:
    - n
    - kernel
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 30
    functionName: networkx.generators.directed.gn_graph
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - seed.random
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - ds.append
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - <builtin>.hasattr
    - attr_dict.update
    - bisect.bisect_left
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - attr.pop
    - datadict.items
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.empty_graph
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - cdf.append
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.generators.directed.gn_graph.kernel
    - networkx.classes.graph.Graph.__iter__
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.from_pandas_edgelist
    - attr.items
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - x
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 76
    functionName: networkx.generators.directed.gn_graph.kernel
    functionSourceFile: networkx.generators.directed
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ds.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbd7790>
    - <ast.Constant object at 0x7f734cce80a0>
    argNames:
    - n
    - p
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 98
    functionName: networkx.generators.directed.gnr_graph
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - seed.random
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - nbrs.items
    - newdict.update
    - networkx.convert.to_networkx_graph
    - networkx.from_numpy_array
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.classic.empty_graph
    - networkx.convert.from_dict_of_lists
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.next
    - networkx.classes.graph.Graph.__init__
    - seed.randrange
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - networkx.classes.multigraph.MultiGraph.__init__
    - datadict.items
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734a65e400>
    - <ast.Constant object at 0x7f734a65e3d0>
    argNames:
    - n
    - create_using
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 152
    functionName: networkx.generators.directed.gnc_graph
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - collections.abc.Mapping.attr.items
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - attr.copy
    - networkx.convert.to_networkx_graph
    - newdict.update
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.from_numpy_array
    - nbrs.items
    - <builtin>.str
    - keylist.append
    - networkx.convert.from_dict_of_dicts
    - seen.add
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.classes.reportviews.OutEdgeView.__init__
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - networkx.convert.from_dict_of_lists
    - networkx.generators.classic.empty_graph
    - <builtin>.set
    - networkx.classes.multidigraph.MultiDiGraph.__init__
    - networkx.classes.digraph.DiGraph.__init__
    - A.is_strict
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.graph.Graph.__init__
    - seed.randrange
    - <builtin>.hasattr
    - attr_dict.update
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - <builtin>.iter
    - networkx.classes.digraph.DiGraph.successors
    - networkx.classes.multigraph.MultiGraph.__init__
    - attr.pop
    - networkx.from_pandas_adjacency
    - networkx.from_scipy_sparse_array
    - datadict.items
    - d.items
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - N.graph.update
    - <builtin>.range
    - collections.abc.Mapping.clear
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - result.graph.update
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.digraph.DiGraph.clear
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - attr.items
    - networkx.from_pandas_edgelist
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - networkx.convert.from_edgelist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 11
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 16
    ICount: 6
    IfCount: 11
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cfc40>
    - <ast.Constant object at 0x7f734a4cf250>
    - <ast.Constant object at 0x7f734a4cf610>
    - <ast.Constant object at 0x7f734a4cfb80>
    - <ast.Constant object at 0x7f734a4cf3a0>
    - <ast.Constant object at 0x7f734a4cf730>
    - <ast.Constant object at 0x7f734a4cfb50>
    argNames:
    - n
    - alpha
    - beta
    - gamma
    - delta_in
    - delta_out
    - seed
    - initial_graph
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 192
    functionName: networkx.generators.directed.scale_free_graph
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - networkx.classes.reportviews.DiDegreeView.__init__
    - keydict.get
    - <builtin>.sum
    - <builtin>.abs
    - <builtin>.int
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - ws.append
    - <builtin>.hasattr
    - networkx.generators.directed.scale_free_graph._choose_node
    - vs.append
    - <builtin>.list
    - <builtin>.iter
    - <builtin>.isinstance
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - node_list.append
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 3
    argDefaultValues: []
    argNames:
    - candidates
    - node_list
    - delta
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 252
    functionName: networkx.generators.directed.scale_free_graph._choose_node
    functionSourceFile: networkx.generators.directed
    functionUses: 1
    functionsReached:
    - <builtin>.len
    - seed.random
    - seed.choice
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_list.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: vs.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ws.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734cd24f70>
    - <ast.Constant object at 0x7f734cd246d0>
    - <ast.Constant object at 0x7f734cd24880>
    argNames:
    - n
    - k
    - self_loops
    - with_replacement
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 343
    functionName: networkx.generators.directed.random_uniform_k_out_graph
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - seed.sample
    - keydict.get
    - keylist.append
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.list
    - <builtin>.iter
    - networkx.generators.directed.random_uniform_k_out_graph.sample
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - seed.choice
    - networkx.classes.graph.Graph.__iter__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 0
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - v
    - nodes
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 410
    functionName: networkx.generators.directed.random_uniform_k_out_graph.sample
    functionSourceFile: networkx.generators.directed
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - seed.sample
    - seed.choice
    - <builtin>.list
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734d3a3be0>
    - <ast.Constant object at 0x7f734d3a34f0>
    argNames:
    - n
    - k
    - alpha
    - self_loops
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 423
    functionName: networkx.generators.directed.random_k_out_graph
    functionSourceFile: networkx.generators.directed
    functionUses: 0
    functionsReached:
    - u.item
    - networkx.generators.directed._random_k_out_graph_python
    - seed.random
    - collections.Counter.keys
    - keydict.get
    - <builtin>.sum
    - v.item
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - collections.Counter.items
    - networkx.generators.directed._random_k_out_graph_numpy
    - networkx.utils.random_sequence.weighted_choice
    - <builtin>.list
    - numpy.arange
    - collections.Counter
    - <builtin>.range
    - collections.Counter.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - collections.Counter.pop
    - seed.choice
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - numpy.zeros
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734bc90c10>
    - <ast.Constant object at 0x7f734bc90490>
    argNames:
    - n
    - k
    - alpha
    - self_loops
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 519
    functionName: networkx.generators.directed._random_k_out_graph_numpy
    functionSourceFile: networkx.generators.directed
    functionUses: 1
    functionsReached:
    - u.item
    - <builtin>.range
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - seed.choice
    - keydict.get
    - v.item
    - <builtin>.len
    - numpy.full
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - numpy.arange
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.zeros
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 5
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5c4b20>
    - <ast.Constant object at 0x7f734b5c4340>
    argNames:
    - n
    - k
    - alpha
    - self_loops
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 550
    functionName: networkx.generators.directed._random_k_out_graph_python
    functionSourceFile: networkx.generators.directed
    functionUses: 1
    functionsReached:
    - seed.random
    - collections.Counter.keys
    - keydict.get
    - <builtin>.sum
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - collections.Counter.items
    - networkx.utils.random_sequence.weighted_choice
    - <builtin>.list
    - collections.Counter
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - collections.Counter.values
    - collections.Counter.pop
    - seed.choice
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: u.item
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: collections.Counter.pop
    functionSourceFile: collections
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.intersection
    functionSourceFile: networkx.generators.intersection
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf730>
    argNames:
    - n
    - m
    - p
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 17
    functionName: networkx.generators.intersection.uniform_random_intersection_graph
    functionSourceFile: networkx.generators.intersection
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - networkx.algorithms.bipartite.random_graph
    - networkx.projected_graph
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.algorithms.bipartite.random_graph
    functionSourceFile: ''
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.projected_graph
    functionSourceFile: ''
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf580>
    argNames:
    - n
    - m
    - k
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 53
    functionName: networkx.generators.intersection.k_random_intersection_graph
    functionSourceFile: networkx.generators.intersection
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.zip
    - networkx._clear_cache
    - seed.sample
    - keydict.get
    - networkx.projected_graph
    - <builtin>.len
    - keylist.append
    - networkx.empty_graph
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734d5ebd30>
    argNames:
    - n
    - m
    - p
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 89
    functionName: networkx.generators.intersection.general_random_intersection_graph
    functionSourceFile: networkx.generators.intersection
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.random
    - datadict.update
    - <builtin>.zip
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - networkx.projected_graph
    - <builtin>.len
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.internet_as_graphs
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.utils.py_random_state
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.utils.decorators.py_random_state
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 3
    argDefaultValues: []
    argNames:
    - a
    - m
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 9
    functionName: networkx.generators.internet_as_graphs.uniform_int_from_avg
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 4
    functionsReached:
    - <builtin>.round
    - seed.random
    - math.floor
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - degs
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 37
    functionName: networkx.generators.internet_as_graphs.choose_pref_attach
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 7
    functionsReached:
    - seed.random
    - degs.keys
    - seed.choice
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - degs.values
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degs.values
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degs.keys
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: -1
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 0
    functionsReached:
    - networkx.utils.py_random_state
    - networkx.utils.decorators.py_random_state
    - collections.namedtuple
    - re.compile
    - networkx.utils.decorators.argmap.__init__
    - networkx.utils.decorators.argmap
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 76
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.__init__
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 1
    functionsReached:
    - <builtin>.max
    - <builtin>.round
    - <builtin>.min
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 4
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 116
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.t_graph
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 2
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - attr_dict.update
    - <builtin>.iter
    - <builtin>.range
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - i
    - j
    - kind
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 137
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 7
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - <builtin>.str
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node_list
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 144
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.choose_peer_pref_attach
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 4
    functionsReached:
    - seed.random
    - degs.keys
    - seed.choice
    - <builtin>.list
    - <builtin>.sum
    - <builtin>.len
    - degs.values
    - networkx.generators.internet_as_graphs.choose_pref_attach
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - node_list
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 6
    functionLinenumber: 156
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.choose_node_pref_attach
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 3
    functionsReached:
    - seed.random
    - networkx.classes.reportviews.DiDegreeView.__init__
    - <builtin>.sum
    - networkx.generators.internet_as_graphs.choose_pref_attach
    - degs.keys
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - <builtin>.dict
    - degs.values
    - networkx.classes.graph.Graph.__iter__
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - i
    - j
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 166
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.add_customer
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 9
    IfCount: 3
    argCount: 6
    argDefaultValues: []
    argNames:
    - self
    - i
    - kind
    - reg2prob
    - avg_deg
    - t_edge_prob
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 7
    functionLinenumber: 175
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.add_node
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 2
    functionsReached:
    - seed.random
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.sum
    - <builtin>.str
    - networkx.generators.internet_as_graphs.choose_pref_attach
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - degs.keys
    - datadict.update
    - networkx.generators.internet_as_graphs.uniform_int_from_avg
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_customer
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - m_options.remove
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - attr_dict.update
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - node_options.intersection
    - <builtin>.list
    - <builtin>.iter
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - node_options.union
    - <builtin>.round
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - <builtin>.dict
    - degs.values
    - networkx.classes.graph.Graph.__iter__
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_node_pref_attach
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - t_options.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_options.union
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_options.intersection
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: m_options.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: t_options.remove
    functionSourceFile: <builtin>
    functionUses: 3
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 4
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - m
    - to_kind
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 234
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.add_m_peering_link
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 3
    functionsReached:
    - seed.random
    - keydict.get
    - <builtin>.sum
    - <builtin>.str
    - networkx.generators.internet_as_graphs.choose_pref_attach
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - degs.keys
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - node_options.remove
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - <builtin>.list
    - <builtin>.iter
    - node_options.difference
    - networkx.classes.digraph.DiGraph.successors
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_peer_pref_attach
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - seed.choice
    - degs.values
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_options.difference
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: node_options.remove
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - cp
    - to_kind
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 274
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.add_cp_peering_link
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 3
    functionsReached:
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - node_options.union
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.list
    - <builtin>.iter
    - node_options.difference
    - networkx.classes.digraph.DiGraph.successors
    - <builtin>.len
    - <builtin>.set
    - <builtin>.str
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - node_options.remove
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - rn
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 321
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.graph_regions
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 2
    functionsReached:
    - <builtin>.range
    - <builtin>.set
    - <builtin>.str
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 3
    argDefaultValues: []
    argNames:
    - self
    - from_kind
    - to_kind
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 5
    functionLinenumber: 334
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.add_peering_links
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 2
    functionsReached:
    - seed.random
    - keydict.get
    - <builtin>.sum
    - <builtin>.str
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.generators.internet_as_graphs.choose_pref_attach
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_cp_peering_link
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_m_peering_link
    - degs.keys
    - datadict.update
    - networkx.generators.internet_as_graphs.uniform_int_from_avg
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - <builtin>.len
    - <builtin>.set
    - node_options.remove
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - <builtin>.list
    - <builtin>.iter
    - node_options.difference
    - networkx.classes.digraph.DiGraph.successors
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_peer_pref_attach
    - node_options.union
    - <builtin>.range
    - <builtin>.round
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - seed.choice
    - degs.values
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 9
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - self
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 8
    functionLinenumber: 352
    functionName: networkx.generators.internet_as_graphs.AS_graph_generator.generate
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 1
    functionsReached:
    - seed.random
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.sum
    - <builtin>.str
    - networkx.generators.internet_as_graphs.choose_pref_attach
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_cp_peering_link
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_peering_links
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_m_peering_link
    - degs.keys
    - datadict.update
    - networkx.generators.internet_as_graphs.uniform_int_from_avg
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_customer
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - m_options.remove
    - node_options.remove
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - networkx.generators.internet_as_graphs.AS_graph_generator.graph_regions
    - attr_dict.update
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - node_options.intersection
    - <builtin>.list
    - <builtin>.iter
    - node_options.difference
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_peer_pref_attach
    - node_options.union
    - networkx.generators.internet_as_graphs.AS_graph_generator.t_graph
    - <builtin>.range
    - <builtin>.round
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_node
    - degs.values
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_node_pref_attach
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - t_options.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f73477bd4f0>
    argNames:
    - n
    - seed
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: 403
    functionName: networkx.generators.internet_as_graphs.random_internet_as_graph
    functionSourceFile: networkx.generators.internet_as_graphs
    functionUses: 0
    functionsReached:
    - networkx.generators.internet_as_graphs.AS_graph_generator.__init__
    - seed.random
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.sum
    - <builtin>.str
    - networkx.generators.internet_as_graphs.choose_pref_attach
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_cp_peering_link
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_peering_links
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_m_peering_link
    - degs.keys
    - datadict.update
    - networkx.generators.internet_as_graphs.uniform_int_from_avg
    - <builtin>.max
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_customer
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - math.floor
    - networkx.classes.multigraph.MultiGraph.degree
    - <builtin>.len
    - <builtin>.set
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - m_options.remove
    - node_options.remove
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_edge
    - networkx.generators.internet_as_graphs.AS_graph_generator.graph_regions
    - attr_dict.update
    - networkx.classes.digraph.DiGraph.degree
    - <builtin>.hasattr
    - node_options.intersection
    - <builtin>.list
    - <builtin>.iter
    - node_options.difference
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - networkx.generators.internet_as_graphs.AS_graph_generator.generate
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_peer_pref_attach
    - node_options.union
    - networkx.generators.internet_as_graphs.AS_graph_generator.t_graph
    - <builtin>.range
    - <builtin>.round
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.nbunch_iter
    - seed.choice
    - <builtin>.min
    - <builtin>.dict
    - networkx.classes.graph.Graph.nodes
    - networkx.generators.internet_as_graphs.AS_graph_generator.add_node
    - degs.values
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.generators.internet_as_graphs.AS_graph_generator.choose_node_pref_attach
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    - t_options.remove
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.ego
    functionSourceFile: networkx.generators.ego
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734ba44ee0>
    - <ast.Constant object at 0x7f734ba44670>
    - <ast.Constant object at 0x7f734ba44c40>
    - <ast.Constant object at 0x7f734ba447c0>
    argNames:
    - G
    - n
    - radius
    - center
    - undirected
    - distance
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 11
    functionName: networkx.generators.ego.ego_graph
    functionSourceFile: networkx.generators.ego
    functionUses: 0
    functionsReached:
    - G.subgraph
    - networkx.single_source_dijkstra
    - G.to_undirected
    - <builtin>.dict
    - H.remove_node
    - networkx.single_source_shortest_path_length
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.geometric
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f7341ecbc10>
    argNames:
    - G
    - radius
    - p
    - pos_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 23
    functionName: networkx.generators.geometric.geometric_edges
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - <builtin>.zip
    - G.nodes
    - <builtin>.sum
    - <builtin>.list
    - networkx.generators.geometric._geometric_edges
    - scipy.spatial.cKDTree
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - kdtree.query_pairs
    - <builtin>.abs
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - G
    - radius
    - p
    - pos_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 89
    functionName: networkx.generators.geometric._geometric_edges
    functionSourceFile: networkx.generators.geometric
    functionUses: 4
    functionsReached:
    - <builtin>.sorted
    - <builtin>.zip
    - <builtin>.sum
    - <builtin>.list
    - scipy.spatial.cKDTree
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - kdtree.query_pairs
    - <builtin>.abs
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: scipy.spatial.cKDTree
    functionSourceFile: scipy
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kdtree.query_pairs
    functionSourceFile: <builtin>
    functionUses: 5
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 7
    argDefaultValues:
    - <ast.Constant object at 0x7f734a4cf4c0>
    - <ast.Constant object at 0x7f734a4cfe50>
    - <ast.Constant object at 0x7f734a4cfdf0>
    - <ast.Constant object at 0x7f734a4cf760>
    argNames:
    - n
    - radius
    - dim
    - pos
    - p
    - seed
    - pos_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 116
    functionName: networkx.generators.geometric.random_geometric_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - seed.random
    - <builtin>.zip
    - keydict.get
    - <builtin>.sum
    - keylist.append
    - networkx.set_node_attributes
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - scipy.spatial.cKDTree
    - <builtin>.len
    - kdtree.query_pairs
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.list
    - networkx.generators.geometric._geometric_edges
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734d611d60>
    - <ast.Constant object at 0x7f734d611040>
    - <ast.Constant object at 0x7f734d6115e0>
    - <ast.Constant object at 0x7f734d6112e0>
    - <ast.Constant object at 0x7f734d611bb0>
    argNames:
    - n
    - radius
    - dim
    - pos
    - p
    - p_dist
    - seed
    - pos_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 210
    functionName: networkx.generators.geometric.soft_random_geometric_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - seed.random
    - <builtin>.zip
    - keydict.get
    - <builtin>.sum
    - <builtin>.filter
    - keylist.append
    - networkx.set_node_attributes
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - scipy.spatial.cKDTree
    - <builtin>.len
    - kdtree.query_pairs
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.list
    - networkx.generators.geometric._geometric_edges
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - dist
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 320
    functionName: networkx.generators.geometric.soft_random_geometric_graph.p_dist
    functionSourceFile: networkx.generators.geometric
    functionUses: 1
    functionsReached:
    - math.exp
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - edge
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 323
    functionName: networkx.generators.geometric.soft_random_geometric_graph.should_join
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - math.exp
    - seed.random
    - <builtin>.zip
    - networkx.generators.geometric.soft_random_geometric_graph.p_dist
    - <builtin>.sum
    - <builtin>.abs
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 4
    IfCount: 4
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f734cc61880>
    - <ast.Constant object at 0x7f734cc61070>
    - <ast.Constant object at 0x7f734cc612e0>
    - <ast.Constant object at 0x7f734cc61a60>
    - <ast.Constant object at 0x7f734cc615b0>
    - <ast.Constant object at 0x7f734cc61430>
    argNames:
    - n
    - theta
    - dim
    - pos
    - weight
    - metric
    - p_dist
    - seed
    - pos_name
    - weight_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 334
    functionName: networkx.generators.geometric.geographical_threshold_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.random
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - seed.expovariate
    - keydict.get
    - <builtin>.len
    - itertools.combinations
    - <builtin>.filter
    - keylist.append
    - networkx.empty_graph
    - networkx.set_node_attributes
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: seed.expovariate
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - r
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 483
    functionName: networkx.generators.geometric.geographical_threshold_graph.p_dist
    functionSourceFile: networkx.generators.geometric
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - pair
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 489
    functionName: networkx.generators.geometric.geographical_threshold_graph.should_join
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - math.dist
    - networkx.generators.geometric.geographical_threshold_graph.p_dist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 8
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f370>
    - <ast.Constant object at 0x7f734b06f7f0>
    - <ast.Constant object at 0x7f734b06f100>
    - <ast.Tuple object at 0x7f734b06f490>
    - <ast.Constant object at 0x7f734cce80a0>
    - <ast.Constant object at 0x7f734cce8dc0>
    argNames:
    - n
    - beta
    - alpha
    - L
    - domain
    - metric
    - seed
    - pos_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 501
    functionName: networkx.generators.geometric.waxman_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - seed.uniform
    - keydict.get
    - <builtin>.filter
    - keylist.append
    - networkx.set_node_attributes
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - pos.values
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.combinations
    - math.dist
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - v
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 621
    functionName: networkx.generators.geometric.waxman_graph.dist
    functionSourceFile: networkx.generators.geometric
    functionUses: 1
    functionsReached:
    - math.dist
    - seed.random
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - pair
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 625
    functionName: networkx.generators.geometric.waxman_graph.should_join
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - math.exp
    - math.dist
    - seed.random
    - networkx.generators.geometric.waxman_graph.dist
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 4
    IfCount: 5
    argCount: 6
    argDefaultValues:
    - <ast.Constant object at 0x7f734cf9d250>
    - <ast.Constant object at 0x7f734cf9dc70>
    - <ast.Constant object at 0x7f734cf9d580>
    - <ast.Constant object at 0x7f734cf9d340>
    - <ast.Constant object at 0x7f734cc90b20>
    argNames:
    - n
    - p
    - q
    - r
    - dim
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 634
    functionName: networkx.generators.geometric.navigable_small_world_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - datadict.update
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - <builtin>.zip
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - seed.uniform
    - keydict.get
    - <builtin>.list
    - <builtin>.sum
    - itertools.accumulate
    - probs.append
    - <builtin>.len
    - bisect.bisect_left
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.abs
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - itertools.product
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: probs.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 10
    argDefaultValues:
    - <ast.Constant object at 0x7f734b5f07c0>
    - <ast.Constant object at 0x7f734b5f0910>
    - <ast.Constant object at 0x7f734aaa8040>
    - <ast.Constant object at 0x7f734aaa8d60>
    - <ast.Constant object at 0x7f734aaa8b20>
    argNames:
    - n
    - radius
    - theta
    - dim
    - pos
    - weight
    - p
    - seed
    - pos_name
    - weight_name
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 707
    functionName: networkx.generators.geometric.thresholded_random_geometric_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - <builtin>.sorted
    - seed.random
    - <builtin>.zip
    - seed.expovariate
    - keydict.get
    - <builtin>.sum
    - keylist.append
    - networkx.set_node_attributes
    - <builtin>.abs
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - ddd.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - scipy.spatial.cKDTree
    - <builtin>.len
    - kdtree.query_pairs
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - <builtin>.list
    - networkx.generators.geometric._geometric_edges
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - itertools.combinations
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.reportviews.NodeView.__init__
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 6
    IfCount: 7
    argCount: 6
    argDefaultValues: []
    argNames:
    - beta
    - n
    - gamma
    - mean_degree
    - kappas
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 842
    functionName: networkx.generators.geometric.geometric_soft_configuration_graph
    functionSourceFile: networkx.generators.geometric
    functionUses: 0
    functionsReached:
    - seed.random
    - networkx.classes.digraph.DiGraph.add_node
    - seed.uniform
    - <builtin>.sum
    - keydict.get
    - networkx.set_node_attributes
    - <builtin>.all
    - kappas.items
    - <builtin>.any
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.max
    - <builtin>.len
    - attr_dict.update
    - kappas.values
    - <builtin>.list
    - <builtin>.range
    - math.fabs
    - networkx.classes.graph.Graph.add_node
    - math.sin
    - math.pow
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - math.log
    - <builtin>.min
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.sin
    functionSourceFile: math
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: math.fabs
    functionSourceFile: math
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kappas.values
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: kappas.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.generators.social
    functionSourceFile: networkx.generators.social
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - edges_seen.add
    - lock.get
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.minimum_spanning_tree
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - ddd.update
    - networkx.algorithms.smallworld.lattice_reference
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 16
    functionName: networkx.generators.social.karate_club_graph
    functionSourceFile: networkx.generators.social
    functionUses: 0
    functionsReached:
    - attr.copy
    - keydict.get
    - newdict.update
    - line.split
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - <builtin>.int
    - datadict.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - <builtin>.len
    - <builtin>.set
    - <builtin>.iter
    - zacharydat.split
    - <builtin>.range
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.graph.Graph.__iter__
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: zacharydat.split
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 4
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 105
    functionName: networkx.generators.social.davis_southern_women_graph
    functionSourceFile: networkx.generators.social
    functionUses: 0
    functionsReached:
    - datadict.update
    - ddd.update
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - attr.copy
    - <builtin>.iter
    - newdict.update
    - <builtin>.len
    - networkx.classes.graph.Graph.__iter__
    - keylist.append
    - networkx.classes.reportviews.NodeView.__iter__
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 21
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 256
    functionName: networkx.generators.social.florentine_families_graph
    functionSourceFile: networkx.generators.social
    functionUses: 0
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 255
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 290
    functionName: networkx.generators.social.les_miserables_graph
    functionSourceFile: networkx.generators.social
    functionUses: 0
    functionsReached:
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx._clear_cache
    - keydict.get
    - <builtin>.len
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: networkx.lazy_imports
    functionSourceFile: networkx.lazy_imports
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734b06f100>
    - <ast.Constant object at 0x7f734b06f490>
    argNames:
    - module_name
    - submodules
    - submod_attrs
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 11
    functionName: networkx.lazy_imports.attach
    functionSourceFile: networkx.lazy_imports
    functionUses: 0
    functionsReached:
    - networkx.lazy_imports.attach.__getattr__
    - submod_attrs.items
    - <builtin>.getattr
    - <builtin>.list
    - <builtin>.set
    - attr_to_modules.keys
    - os.environ.get
    - importlib.import_module
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: submod_attrs.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: attr_to_modules.keys
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 0
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - name
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 63
    functionName: networkx.lazy_imports.attach.__getattr__
    functionSourceFile: networkx.lazy_imports
    functionUses: 1
    functionsReached:
    - <builtin>.getattr
    - importlib.import_module
    linkageType: pythonLinkage
    raised:
    - AttributeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.import_module
    functionSourceFile: importlib
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 72
    functionName: networkx.lazy_imports.attach.__dir__
    functionSourceFile: networkx.lazy_imports
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 4
    argDefaultValues: []
    argNames:
    - self
    - frame_data
    - args
    - kwargs
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 83
    functionName: networkx.lazy_imports.DelayedImportErrorModule.__init__
    functionSourceFile: networkx.lazy_imports
    functionUses: 1
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 2
    argDefaultValues: []
    argNames:
    - self
    - x
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 87
    functionName: networkx.lazy_imports.DelayedImportErrorModule.__getattr__
    functionSourceFile: networkx.lazy_imports
    functionUses: 0
    functionsReached:
    - <builtin>.super
    linkageType: pythonLinkage
    raised:
    - ModuleNotFoundError
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 2
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - fullname
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 100
    functionName: networkx.lazy_imports._lazy_import
    functionSourceFile: networkx.lazy_imports
    functionUses: 0
    functionsReached:
    - importlib.util.module_from_spec
    - <builtin>.super
    - importlib.util.find_spec
    - networkx.lazy_imports.DelayedImportErrorModule.__init__
    - loader.exec_module
    - importlib.util.LazyLoader
    - inspect.stack
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.util.find_spec
    functionSourceFile: importlib
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: inspect.stack
    functionSourceFile: inspect
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.util.module_from_spec
    functionSourceFile: importlib
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: importlib.util.LazyLoader
    functionSourceFile: importlib
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: loader.exec_module
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: -1
    functionName: networkx.conftest
    functionSourceFile: networkx.conftest
    functionUses: 0
    functionsReached:
    - pytest.fixture
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - parser
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 24
    functionName: networkx.conftest.pytest_addoption
    functionSourceFile: networkx.conftest
    functionUses: 0
    functionsReached:
    - parser.addoption
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: parser.addoption
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 2
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - config
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 43
    functionName: networkx.conftest.pytest_configure
    functionSourceFile: networkx.conftest
    functionUses: 0
    functionsReached:
    - config.addinivalue_line
    - config.getoption
    - importlib.metadata.entry_points
    - os.environ.get
    - warnings.warn
    - <builtin>.bool
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: config.addinivalue_line
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: config.getoption
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 2
    IfCount: 5
    argCount: 2
    argDefaultValues: []
    argNames:
    - config
    - items
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 78
    functionName: networkx.conftest.pytest_collection_modifyitems
    functionSourceFile: networkx.conftest
    functionUses: 0
    functionsReached:
    - <builtin>.hasattr
    - <builtin>.getattr
    - config.getoption
    - item.add_marker
    - pytest.mark.skip
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pytest.mark.skip
    functionSourceFile: pytest
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: item.add_marker
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: pytest.fixture
    functionSourceFile: pytest
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 5
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 104
    functionName: networkx.conftest.set_warnings
    functionSourceFile: networkx.conftest
    functionUses: 0
    functionsReached:
    - warnings.filterwarnings
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: warnings.filterwarnings
    functionSourceFile: warnings
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - doctest_namespace
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 127
    functionName: networkx.conftest.add_nx
    functionSourceFile: networkx.conftest
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.readwrite.p2g
    functionSourceFile: networkx.readwrite.p2g
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.algorithms.cuts.node_expansion
    - networkx.minimum_spanning_tree
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.utils.decorators.open_file
    - path.append
    - networkx.has_path
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 6
    IfCount: 0
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f734bb55b80>
    argNames:
    - G
    - path
    - encoding
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 42
    functionName: networkx.readwrite.p2g.write_p2g
    functionSourceFile: networkx.readwrite.p2g
    functionUses: 0
    functionsReached:
    - G.size
    - <builtin>.range
    - path.write
    - <builtin>.zip
    - G.order
    - <builtin>.list
    - <builtin>.len
    - <builtin>.dict
    - G.neighbors
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734b101550>
    argNames:
    - path
    - encoding
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 64
    functionName: networkx.readwrite.p2g.read_p2g
    functionSourceFile: networkx.readwrite.p2g
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - attr_dict.update
    - datadict.update
    - networkx.readwrite.p2g.parse_p2g
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - line.decode
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - <builtin>.map
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 3
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - lines
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 88
    functionName: networkx.readwrite.p2g.parse_p2g
    functionSourceFile: networkx.readwrite.p2g
    functionUses: 1
    functionsReached:
    - <builtin>.range
    - attr_dict.update
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.len
    - <builtin>.map
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - <builtin>.next
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 9
    functionLinenumber: -1
    functionName: networkx.algorithms.threshold
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - networkx.is_directed_acyclic_graph
    - networkx.reverse_view
    - seed.random
    - networkx.classes.graph.Graph.number_of_edges
    - scc_queue.pop
    - nodelist.index
    - networkx.algorithms.link_prediction.adamic_adar_index.predict
    - numpy.fill_diagonal
    - G2.remove_edge
    - <builtin>.str
    - networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs
    - H.subgraph
    - networkx.algorithms.cycles.simple_cycles
    - networkx.algorithms.chordal._find_chordality_breaker
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - numpy.full
    - networkx.classes.graph.Graph.size
    - networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor
    - itertools.starmap
    - networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors
    - excluded_colors.update
    - R_cal.append
    - networkx.algorithms.broadcasting._get_broadcast_centers
    - collections.abc.Mapping.keys
    - networkx.dominating_set
    - networkx.ancestors
    - networkx.convert.from_dict_of_lists
    - networkx.maximal_matching
    - networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation
    - collections.defaultdict.values
    - networkx.algorithms.components.weakly_connected.number_weakly_connected_components
    - networkx.algorithms.euler._multigraph_eulerian_circuit
    - collections.deque.extend
    - networkx.algorithms.bipartite.hopcroft_karp_matching
    - networkx.utils.decorators.argmap
    - edges_seen.add
    - networkx.algorithms.components.biconnected.biconnected_component_edges
    - lock.get
    - attr_dict.update
    - networkx.algorithms.bipartite.cluster.latapy_clustering
    - networkx.utils.heaps.BinaryHeap.pop
    - networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange
    - rightmatches.items
    - bisect.bisect_left
    - connected_dominating_set.add
    - networkx.classes.multidigraph.MultiDiGraph.reverse
    - networkx.from_pandas_adjacency
    - heapq.heapify
    - copy.deepcopy.predecessors
    - collections.defaultdict
    - cycle.extend
    - F.items
    - networkx.edge_dfs
    - networkx.algorithms.link_prediction.adamic_adar_index
    - C.neighbors
    - networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor
    - neighbors.union
    - networkx.algorithms.cluster.square_clustering
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.algorithms.planarity.PlanarEmbedding.copy
    - collections.deque.pop
    - copy.deepcopy
    - networkx.algorithms.matching.is_maximal_matching
    - many_to_one.items
    - values.max
    - graph.values
    - networkx.algorithms.centrality.group.group_out_degree_centrality
    - networkx.utils.random_sequence.discrete_sequence
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path
    - sympy.simplify
    - networkx.connected_components
    - collections.defaultdict.keys
    - attr.copy
    - components.extend
    - networkx.algorithms.components.strongly_connected.number_strongly_connected_components
    - networkx.algorithms.traversal.edgebfs.edge_bfs
    - networkx.algorithms.bipartite.matching.eppstein_matching.recurse
    - networkx.algorithms.dag.topological_generations
    - networkx.transitive_closure
    - networkx.utils.misc.pairwise
    - bases.pop
    - networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C
    - networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity
    - networkx.dfs_preorder_nodes
    - color.update
    - next_parents_children.append
    - C.subgraph
    - networkx.algorithms.threshold.find_creation_sequence
    - G.add_nodes_from
    - <builtin>.set
    - networkx.algorithms.dag.is_aperiodic
    - networkx.algorithms.planarity.PlanarEmbedding.remove_node
    - networkx.classes.multigraph.MultiGraph.number_of_edges
    - hampath.insert
    - X.issubset
    - networkx.algorithms.connectivity.kcomponents._reconstruct_k_components
    - expA.diagonal
    - networkx.algorithms.similarity.simrank_similarity
    - H.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.__init__
    - <builtin>.iter
    - dfs_stack.append
    - networkx.algorithms.distance_measures.diameter
    - <builtin>.callable
    - nodes.issubset
    - H.add_nodes_from
    - bases.append
    - networkx.classes.multidigraph.MultiDiGraph.to_undirected
    - H.graph.get
    - networkx.algorithms.triads.all_triads
    - networkx.algorithms.approximation.clique.clique_removal
    - networkx.utils.misc.arbitrary_element
    - networkx.algorithms.components.biconnected.is_biconnected
    - T.remove_nodes_from
    - min_cover.add
    - networkx.algorithms.connectivity.connectivity.average_node_connectivity
    - visited.intersection
    - networkx.dfs_edges
    - networkx.algorithms.bipartite.redundancy._node_redundancy
    - networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components
    - i_2.add
    - networkx.node_connected_component
    - networkx.classes.reportviews.InEdgeView.__iter__
    - networkx.algorithms.link_prediction._community
    - numpy.linalg.eigh
    - blocked.add
    - remaining_nodes.pop
    - networkx.from_pandas_edgelist
    - dfs_stack.pop
    - children.append
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality
    - Gv.get
    - networkx.classes.multigraph.MultiGraph.to_undirected
    - networkx.isolates
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length
    - G.__class__
    - itertools.permutations
    - W.add
    - networkx.degree_histogram
    - newdict.update
    - C.degree
    - networkx.utils.misc.groups
    - x.tolist
    - bin_boundaries.extend
    - networkx.generic_bfs_edges
    - networkx.algorithms.d_separation.is_d_separator
    - networkx.algorithms.centrality.load._edge_betweenness
    - numpy.empty
    - H.edges
    - nextlevel.append
    - layer.append
    - itertools.pairwise
    - math.exp
    - functools.reduce
    - numpy.ceil
    - cand.copy
    - networkx.algorithms.connectivity.connectivity.local_node_connectivity
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_components
    - cycles.append
    - <builtin>.len
    - networkx.is_connected
    - networkx.subgraph
    - networkx.classes.digraph.DiGraph.in_degree
    - coloring.values
    - set.intersection
    - networkx.algorithms.traversal.breadth_first_search.bfs_layers
    - networkx._dispatchable
    - networkx.dfs_labeled_edges
    - numpy.eye
    - gnodes.pop
    - networkx.algorithms.bipartite.matching.to_vertex_cover
    - coloring.items
    - networkx.biconnected_components
    - networkx.algorithms.d_separation.is_minimal_d_separator
    - networkx.average_shortest_path_length
    - networkx.classes.multigraph.MultiGraph.remove_edges_from
    - networkx.algorithms.d_separation.find_minimal_d_separator
    - networkx.algorithms.community.label_propagation._most_frequent_labels
    - heapq.heappush
    - networkx.algorithms.centrality.group.group_in_degree_centrality
    - networkx.algorithms.connectivity.edge_kcomponents.bridge_components
    - matching.copy
    - numpy.arange
    - itertools.product
    - networkx.algorithms.connectivity.kcomponents.k_components
    - networkx.algorithms.approximation.dominating_set.min_edge_dominating_set
    - networkx.algorithms.centrality.voterank_alg.voterank
    - G.size
    - networkx.algorithms.tree.distance_measures.centroid._heaviest_child
    - networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition
    - networkx.classes.multidigraph.MultiDiGraph.in_degree
    - y.intersection
    - seed.choice
    - itertools.accumulate
    - networkx.number_of_isolates
    - <builtin>.super
    - G.nbunch_iter
    - networkx.classes.reportviews.NodeView.__init__
    - collections.abc.Mapping.items
    - numpy.zeros
    - networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected
    - networkx.algorithms.broadcasting._get_max_broadcast_value
    - networkx.classes.digraph.DiGraph.predecessors
    - networkx.complete_graph
    - networkx.algorithms.dag.v_structures
    - meta_to_wuv.keys
    - C.add_edges_from
    - S.update
    - A_cal.add
    - networkx.from_numpy_array
    - networkx.maximum_flow_value
    - <builtin>.enumerate
    - networkx.algorithms.community.label_propagation._labeling_complete
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation
    - networkx.algorithms.efficiency_measures.local_efficiency
    - networkx.all_pairs_shortest_path_length
    - networkx.algorithms.bipartite.basic.color
    - cutset.update
    - <builtin>.bool
    - ruled_out.update
    - networkx.algorithms.tree.distance_measures.centroid
    - ds.sort
    - networkx.algorithms.bipartite.basic.is_bipartite
    - numpy.where
    - current_path.popitem
    - numpy.diag
    - networkx.algorithms.simple_paths.is_simple_path
    - networkx.classes.digraph.DiGraph.add_nodes_from
    - visited_nodes.add
    - excluded_colors.union
    - edges.append
    - networkx.algorithms.dag.lexicographical_topological_sort
    - H.neighbors
    - itertools.chain
    - networkx.node_disjoint_paths
    - newLayer.setdefault
    - d.popitem
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>
    - networkx.antichains
    - G.add_edge
    - C.add_nodes_from
    - networkx.density
    - networkx.algorithms.centrality.load.edge_load_centrality
    - networkx.chordal_graph_cliques
    - networkx.classes.digraph.DiGraph.in_edges
    - pl_n.items
    - networkx.algorithms.planarity.ConflictPair.__init__
    - T.neighbors
    - networkx.classes.graph.Graph.order
    - networkx.classes.function.number_of_selfloops
    - isets.append
    - closed.append
    - networkx.algorithms.components.attracting.is_attracting_component
    - networkx.algorithms.planarity.LRPlanarity.dfs_embedding
    - networkx.immediate_dominators
    - dominating_set.add
    - networkx.algorithms.euler._find_path_start
    - dsdict.items
    - depth.items
    - networkx.algorithms.components.connected.number_connected_components
    - STRATEGIES.get
    - degrees.pop
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id
    - T.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.out_degree
    - I_set.add
    - networkx.algorithms.components.biconnected._biconnected_dfs
    - networkx.is_strongly_connected
    - networkx.algorithms.link_prediction.common_neighbor_centrality
    - networkx.algorithms.planarity.LRPlanarity.__init__
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length
    - antichains_stacks.append
    - itertools.islice
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q
    - remaining_nodes.remove
    - u_nbrs.intersection
    - cycle.append
    - networkx.algorithms.coloring.greedy_coloring._Node.__init__
    - <builtin>.any
    - networkx.algorithms.approximation.density._fista
    - unseen_degree.items
    - sympy.Symbol
    - networkx.algorithms.dominance.immediate_dominators
    - networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges
    - networkx.classes.multidigraph.MultiDiGraph.in_edges
    - datadict.update
    - C.nodes
    - collections.deque.appendleft
    - networkx.algorithms.matching.is_matching
    - itertools.dropwhile
    - networkx.algorithms.triads.triadic_census
    - networkx.algorithms.cycles._johnson_cycle_search
    - order.pop
    - functools.partial
    - networkx.algorithms.tree.recognition.is_forest
    - bridge_connectors.add
    - B.sum
    - networkx.algorithms.components.attracting.number_attracting_components
    - networkx.condensation
    - G.adj.items
    - networkx.algorithms.bipartite.cluster._four_cycles
    - R0.pop
    - networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
    - networkx.algorithms.dominating.dominating_set
    - numpy.allclose
    - networkx.number_of_selfloops
    - neighbs.intersection
    - <builtin>.float
    - networkx.selfloop_edges
    - networkx.algorithms.bipartite.matching.eppstein_matching
    - queue.pop
    - cbc.items
    - networkx.from_scipy_sparse_array
    - collections.Counter
    - colors.items
    - order.reverse
    - G.in_edges
    - networkx.classes.digraph.DiGraph.out_edges
    - networkx.algorithms.tournament.index_satisfying
    - Q.right.copy
    - networkx.algorithms.richclub._compute_rc
    - networkx.classes.multidigraph.MultiDiGraph.edges
    - L.keys
    - networkx.node_connectivity
    - networkx.algorithms.planarity.top_of_stack
    - c.items
    - G.copy
    - copy.deepcopy.neighbors
    - reverse_fringe.append
    - networkx.algorithms.euler._simplegraph_eulerian_circuit
    - networkx.algorithms.planarity.LRPlanarity.lr_planarity
    - G._adj.values
    - networkx.classes.multigraph.MultiGraph.to_undirected_class
    - Q.swap
    - components.append
    - networkx.algorithms.dag.topological_sort
    - collections.defaultdict.items
    - two_hop_neighbors.discard
    - networkx.algorithms.cuts.boundary_expansion
    - networkx.algorithms.clique.find_cliques_recursive
    - networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges
    - networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity
    - networkx.algorithms.dag.root_to_leaf_paths
    - unnumbered.remove
    - networkx.algorithms.chordal.find_induced_nodes
    - values.update
    - networkx.algorithms.shortest_paths.unweighted.predecessor
    - networkx.algorithms.components.connected._plain_bfs
    - networkx.algorithms.dag.has_cycle
    - networkx.algorithms.tournament.hamiltonian_path
    - networkx.is_directed
    - <builtin>.all
    - H.remove_edge
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges
    - seen.add
    - remaining.difference_update
    - influential_nodes.append
    - forward_fringe.append
    - networkx.classes.multidigraph.MultiDiGraph.is_multigraph
    - networkx.convert.from_dict_of_dicts
    - networkx.algorithms.matching.maximal_matching
    - T.degree
    - networkx.algorithms.bridges.has_bridges
    - scipy.linalg.expm
    - stack.pop
    - networkx.algorithms.chordal._find_missing_edge
    - antichains_stacks.pop
    - networkx.algorithms.communicability_alg.communicability_exp
    - matching.items
    - G._adj.items
    - networkx.dfs_tree
    - G.is_directed
    - graph.remove_nodes_from
    - next_level.append
    - networkx.classes.digraph.DiGraph.degree
    - ext_u.pop
    - scipy.linalg.eigvals
    - networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality
    - networkx.is_tree
    - networkx.algorithms.triads._tricode
    - networkx.algorithms.connectivity.connectivity.node_connectivity
    - visited_edges.add
    - collections.Counter.update
    - networkx.algorithms.components.connected.is_connected
    - networkx.algorithms.community.quality.intra_community_edges
    - networkx.algorithms.reciprocity.overall_reciprocity
    - networkx.algorithms.tournament.is_reachable
    - copy.copy
    - networkx.algorithms.link_prediction.jaccard_coefficient.predict
    - avail.values
    - frontier.append
    - cand_init.copy
    - frozenset.union
    - dist.values
    - cs.extend
    - networkx.utils.arbitrary_element
    - explored.update
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs
    - networkx.tree_all_pairs_lowest_common_ancestor
    - H.add_edge
    - networkx.drawing.nx_agraph.from_agraph
    - networkx.algorithms.planarity.LRPlanarity.remove_back_edges
    - networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from
    - G1.remove_edges_from
    - networkx.average_clustering
    - networkx.algorithms.bipartite.basic.is_bipartite_node_set
    - networkx.algorithms.coloring.equitable_coloring.make_C_from_F
    - H.get_edge_data
    - C.remove_edge
    - networkx.transitivity
    - networkx.algorithms.coloring.equitable_coloring.pad_graph
    - networkx.directed_modularity_matrix
    - networkx.double_edge_swap
    - networkx.to_scipy_sparse_array
    - networkx.set_node_attributes
    - networkx.algorithms.asteroidal.create_component_structure
    - networkx.algorithms.connectivity.edge_augmentation.complement_edges
    - networkx.utils.pairwise
    - cand.remove
    - G.subgraph
    - math.gcd
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - U.add
    - numpy.array
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search
    - networkx.classes.multigraph.MultiGraph.degree
    - induced_nodes.add
    - u_neighborhood.union
    - networkx.classes.multigraph.MultiGraph.add_edges_from
    - networkx.classes.multidigraph.MultiDiGraph.remove_edge
    - networkx.algorithms.planarity.LRPlanarity.dfs_testing
    - networkx.classes.graph.Graph.has_edge
    - networkx.algorithms.centrality.subgraph_alg.estrada_index
    - networkx.algorithms.traversal.breadth_first_search.bfs_edges
    - sub_avail.keys
    - networkx.algorithms.asteroidal.find_asteroidal_triple
    - scipy.linalg.eigvalsh
    - H.is_directed
    - networkx.algorithms.regular.is_k_regular
    - networkx.algorithms.cycles.find_cycle.tailhead
    - H.order
    - networkx.algorithms.cluster.transitivity
    - networkx.classes.digraph.DiGraph.reverse
    - networkx.classes.reportviews.InMultiEdgeView.__init__
    - networkx.algorithms.bipartite.extendability.maximal_extendability
    - G.out_edges
    - ds.pop
    - G2.has_edge
    - G.adjacency
    - seed.shuffle
    - networkx.algorithms.distance_measures._extrema_bounding
    - Q.left.empty
    - <builtin>.range
    - node_to_id.get
    - R0.add
    - networkx.classes.graphviews.generic_graph_view
    - onodes.pop
    - networkx.k_edge_augmentation
    - I_covered.update
    - S_ancestors.update
    - networkx.algorithms.simple_paths.all_simple_edge_paths
    - networkx.algorithms.cycles.chordless_cycles
    - cmap.items
    - networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges
    - networkx.algorithms.coloring.equitable_coloring.procedure_P
    - networkx.algorithms.triads.triads_by_type
    - networkx.algorithms.coloring.equitable_coloring.change_color
    - heapq.heappop
    - networkx.classes.coreviews.UnionAdjacency.__init__
    - G.number_of_edges
    - networkx.algorithms.centrality.dispersion.dispersion
    - <builtin>.map
    - maximum_matching.keys
    - networkx.algorithms.bipartite.basic.sets
    - networkx.shortest_path
    - networkx.is_regular
    - networkx.classes.reportviews.OutEdgeView.__init__
    - numpy.clip
    - networkx.algorithms.cluster.all_triangles
    - Y.isdisjoint
    - numpy.nonzero
    - networkx.nodes_with_selfloops
    - networkx.algorithms.dag.lexicographical_topological_sort.create_tuple
    - networkx.algorithms.link_prediction._apply_prediction
    - vertex_stack.append
    - networkx.adjacency_matrix
    - networkx.algorithms.dominating.connected_dominating_set
    - seen.update
    - networkx.algorithms.components.weakly_connected.weakly_connected_components
    - collections.Counter.items
    - networkx.algorithms.chordal.chordal_graph_cliques
    - cliques.append
    - networkx.algorithms.connectivity.cuts.minimum_st_node_cut
    - networkx.to_numpy_array
    - networkx.classes.graph.Graph.__init__
    - numpy.mean
    - <builtin>.frozenset
    - networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N
    - only1_adj.items
    - networkx.algorithms.threshold.find_alternating_4_cycle
    - networkx.algorithms.smallworld.random_reference
    - avail.intersection
    - networkx.algorithms.planarity.LRPlanarity.sign
    - itertools.count
    - adjacency_matrix.sum
    - seen.append
    - networkx.bethe_hessian_matrix
    - N.graph.update
    - networkx.algorithms.tournament.is_reachable.two_neighborhood
    - networkx.algorithms.centrality.degree_alg.in_degree_centrality
    - networkx.algorithms.coloring.equitable_coloring.move_witnesses
    - networkx.utils.union_find.UnionFind.union
    - backward_visited.add
    - networkx.linalg.bethehessianmatrix.bethe_hessian_matrix
    - networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors
    - processed.append
    - G.reverse
    - collections.deque
    - networkx.algorithms.connectivity.kcutsets.all_node_cuts
    - unmatched.append
    - collections.Counter.values
    - result.graph.update
    - networkx.utils.random_sequence.cumulative_distribution
    - networkx.algorithms.isolate.isolates
    - networkx.algorithms.approximation.clique.max_clique
    - G1.subgraph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from
    - pred.pop
    - G.degree
    - B_cal_prime.add
    - networkx.classes.coreviews.FilterAdjacency.__init__
    - networkx.algorithms.approximation.clique.large_clique_size
    - queue.popleft
    - networkx.classes.coreviews.FilterAtlas.__init__
    - unseen.remove
    - A.edges
    - marked.update
    - post.pop
    - nbrs.items
    - path.reverse
    - networkx.convert.to_networkx_graph
    - networkx.algorithms.bipartite.cluster.robins_alexander_clustering
    - networkx.algorithms.d_separation._reachable._pass
    - networkx.algorithms.walks.number_of_walks
    - networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length
    - networkx.algorithms.community.kclique.k_clique_communities
    - pl_n.update
    - networkx.single_source_shortest_path_length
    - networkx.weakly_connected_components
    - G1.number_of_nodes
    - networkx.algorithms.components.strongly_connected.is_strongly_connected
    - networkx.algorithms.bipartite.sets
    - nodes.append
    - networkx.algorithms.community.kclique._get_adjacent_cliques
    - adjacent_cliques.add
    - networkx.algorithms.connectivity.kcomponents._consolidate
    - networkx.algorithms.planarity.Interval.empty
    - zero_indegree.append
    - networkx.number_of_spanning_trees
    - induced_nodes.update
    - networkx.algorithms.cycles.cycle_basis
    - networkx.algorithms.approximation.ramsey.ramsey_R2
    - networkx.algorithms.simple_paths.all_simple_paths
    - networkx.algorithms.broadcasting.tree_broadcast_center
    - sizes.get
    - scc.add
    - networkx.algorithms.planarity.LRPlanarity.add_constraints
    - networkx.chain_decomposition
    - networkx.algorithms.components.weakly_connected.is_weakly_connected
    - networkx.utils.heaps.BinaryHeap.insert
    - G.is_multigraph
    - H.degree
    - pl_u.update
    - avail.keys
    - networkx.algorithms.tree.recognition.is_arborescence
    - networkx.algorithms.dag.ancestors
    - networkx.algorithms.clique.node_clique_number
    - networkx.utils.union_find.UnionFind.__init__
    - networkx.algorithms.community.asyn_fluid.asyn_fluidc
    - networkx.algorithms.dag.all_topological_sorts
    - nodes.update
    - networkx.algorithms.dag.is_directed_acyclic_graph
    - networkx.algorithms.coloring.equitable_coloring.equitable_color
    - networkx.utils.decorators.not_implemented_for
    - census.values
    - itertools.chain.from_iterable
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint
    - collections.abc.Mapping.attr.items
    - networkx.algorithms.link_prediction.within_inter_cluster.predict
    - queue.append
    - networkx.algorithms.cluster.triangles
    - networkx.classes.reportviews.OutMultiEdgeView.__iter__
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build
    - keydict.items
    - keydict.get
    - networkx.algorithms.link_prediction.resource_allocation_index.predict
    - networkx.algorithms.chordal._max_cardinality_node
    - networkx.all_neighbors
    - set.union
    - keylist.append
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment
    - <builtin>.abs
    - networkx.algorithms.coloring.equitable_coloring.is_coloring
    - networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges
    - networkx.algorithms.planarity.get_counterexample
    - collections.deque.append
    - R.number_of_edges
    - networkx.algorithms.shortest_paths.generic.has_path
    - later_nbrs.items
    - networkx.algorithms.community.label_propagation._update_label
    - networkx.algorithms.approximation.density.densest_subgraph
    - networkx.classes.graph.Graph.is_directed
    - G.predecessors
    - operator.itemgetter
    - networkx.algorithms.traversal.breadth_first_search.bfs_predecessors
    - numpy.add.at
    - networkx.common_neighbors
    - networkx.algorithms.smallworld.omega
    - networkx.algorithms.asteroidal.is_at_free
    - q.append
    - Gu.items
    - networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes
    - current_path.keys
    - <builtin>.hasattr
    - networkx.minimum_spanning_arborescence
    - networkx.algorithms.chordal._is_complete_graph
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length
    - mapping.update
    - networkx.topological_generations
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core
    - networkx.algorithms.components.semiconnected.is_semiconnected
    - <builtin>.isinstance
    - G.neighbors
    - missing.pop
    - verts.copy
    - networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation
    - networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct
    - <builtin>.min
    - C.remove_edges_from
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - targets.items
    - networkx.algorithms.tournament.is_tournament
    - networkx.algorithms.cycles._chordless_cycle_search
    - networkx.utils.backends._dispatchable
    - attr.items
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edge
    - networkx.node_boundary
    - blen.append
    - networkx._clear_cache
    - itertools.compress
    - networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge
    - matching.add
    - networkx.algorithms.tree.recognition.is_tree
    - networkx.is_perfect_matching
    - networkx.algorithms.bipartite.matching._connected_by_alternating_paths
    - networkx.algorithms.reciprocity._reciprocity_iter
    - networkx.classes.reportviews.DiDegreeView.__init__
    - networkx.algorithms.centrality.degree_alg.degree_centrality
    - networkx.bfs_labeled_edges
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs
    - labeling.items
    - rc.items
    - C.number_of_nodes
    - networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path
    - networkx.algorithms.clique.find_cliques_recursive.expand
    - G.add_edges_from
    - networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path
    - networkx.algorithms.dag.descendants
    - e.values
    - networkx.algorithms.connectivity.connectivity.edge_connectivity
    - networkx.algorithms.matching.matching_dict_to_set
    - networkx.algorithms.clique.enumerate_all_cliques
    - networkx.is_eulerian
    - networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching
    - I_covered.add
    - c_1.add
    - networkx.algorithms.cluster.generalized_degree
    - stack.append
    - B.subgraph
    - D.pop
    - networkx.algorithms.dag.lexicographical_topological_sort.key
    - cint.get
    - scc_found.update
    - copy.deepcopy.is_directed
    - <builtin>.tuple
    - networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic
    - networkx.algorithms.euler.is_semieulerian
    - bint.get
    - x.copy
    - cs.append
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - collections.deque.copy
    - networkx.has_bridges
    - this_layer.append
    - networkx.classes.graphviews.subgraph_view
    - networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation
    - T.remove_node
    - G.nodes
    - networkx.algorithms.tree.distance_measures._subtree_sizes
    - networkx.algorithms.community.label_propagation._color_network
    - networkx.algorithms.community.community_utils.is_partition
    - networkx.algorithms.efficiency_measures.global_efficiency
    - networkx.algorithms.cycles._directed_cycle_search
    - networkx.classes.digraph.DiGraph.remove_node
    - networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs
    - networkx.algorithms.connectivity.cuts.minimum_edge_cut
    - networkx.topological_sort
    - networkx.algorithms.cycles.girth
    - networkx.algorithms.planarity.Interval.__init__
    - edge_stack.append
    - networkx.algorithms.dag.antichains
    - collections.Counter.keys
    - networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation
    - maximum_matching.items
    - new.add
    - numpy.append
    - networkx.algorithms.planarity.is_planar
    - networkx.algorithms.euler.eulerian_circuit
    - itertools.combinations_with_replacement
    - succs.pop
    - networkx.restricted_view
    - networkx.classes.filters.show_nodes.__init__
    - networkx.algorithms.distance_regular.intersection_array
    - networkx.algorithms.tournament.hamiltonian_path.<lambda1>
    - meta_mst.edges
    - networkx.algorithms.simple_paths._all_simple_edge_paths
    - networkx.relabel_nodes
    - networkx.classes.graph.Graph.nbunch_iter.bunch_iter
    - w.max
    - networkx.algorithms.cycles.find_cycle
    - <builtin>.next
    - scipy.sparse.eye_array
    - G2.add_edge
    - indep_nodes.append
    - m.update
    - networkx.is_k_edge_connected
    - collections.namedtuple
    - G.remove_edge
    - networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes
    - <builtin>.list
    - networkx.classes.digraph.DiGraph.successors
    - networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
    - verts.update
    - networkx.bfs_edges
    - networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first
    - networkx.algorithms.chordal.chordal_graph_treewidth
    - U.remove
    - networkx.algorithms.connectivity.cuts.minimum_node_cut
    - networkx.modularity_matrix
    - visited.add
    - networkx.algorithms.connectivity.kcomponents._generate_partition
    - networkx.algorithms.bipartite.matching._is_connected_by_alternating_path
    - networkx.freeze
    - itertools.tee
    - networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ
    - networkx.algorithms.dominating.is_connected_dominating_set
    - networkx.set_edge_attributes
    - networkx.classes.reportviews.NodeView.__iter__
    - reachable.extend
    - networkx.algorithms.connectivity.kcutsets._is_separating_set
    - networkx.algorithms.mis.maximal_independent_set
    - numpy.exp
    - <builtin>.zip
    - nodeset.union
    - new_clique_wanna_be.add
    - networkx.algorithms.planarity.check_planarity
    - networkx.algorithms.chains.chain_decomposition
    - networkx.algorithms.flow.edmondskarp.edmonds_karp
    - <builtin>.filter
    - networkx.minimum_spanning_tree
    - networkx.algorithms.cuts.node_expansion
    - H.add_edges_from
    - networkx.transitive_closure_dag
    - Q.append
    - networkx.ego_graph
    - networkx.number_of_edges
    - Q.left.copy
    - Q.right.conflicting
    - high_labels.pop
    - networkx.algorithms.traversal.depth_first_search.dfs_successors
    - math.sqrt
    - networkx.non_neighbors
    - current_path.values
    - networkx.algorithms.approximation.density._fractional_peeling
    - networkx.algorithms.distance_regular.is_distance_regular
    - ubetween.items
    - <builtin>.max
    - re.compile
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges._try_getitem
    - networkx.algorithms.smallworld.lattice_reference
    - ddd.update
    - networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors
    - networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_impl
    - networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search
    - networkx.algorithms.covering.is_edge_cover
    - networkx.algorithms.d_separation._reachable
    - networkx.classes.reportviews.InMultiEdgeView.__iter__
    - networkx.classes.function.is_empty
    - H.graph.update
    - networkx.shortest_path_length
    - networkx.degree
    - remaining.issuperset
    - networkx.k_edge_subgraphs
    - networkx.algorithms.components.attracting.attracting_components
    - networkx.algorithms.flow.utils.build_residual_network
    - networkx.algorithms.dag.colliders
    - networkx.algorithms.smetric.s_metric
    - networkx.classes.multigraph.MultiGraph.has_edge
    - networkx.classes.graph.Graph.remove_edges_from
    - networkx.classes.multigraph.MultiGraph.copy
    - networkx.algorithms.communicability_alg.communicability
    - networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path
    - attr.pop
    - networkx.algorithms.tree.recognition.is_branching
    - networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges
    - preds.pop
    - edges.add
    - networkx.complement
    - networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest
    - H.out_edges
    - d.get
    - networkx.classes.graph.Graph.add_node
    - networkx.algorithms.planarity.PlanarEmbedding.__init__
    - networkx.algorithms.triads.is_triad
    - math.log
    - networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id
    - G.has_edge
    - itertools.combinations
    - available_nodes.difference_update
    - active_nodes.remove
    - networkx.convert.to_dict_of_lists
    - networkx.strongly_connected_components
    - networkx.algorithms.reciprocity.reciprocity
    - aug_edges.remove
    - forward_visited.add
    - networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp
    - collections.abc.Mapping.get
    - networkx.algorithms.link_prediction.jaccard_coefficient
    - networkx.algorithms.chordal.is_chordal
    - networkx.minimum_cut
    - G.number_of_nodes
    - networkx.classes.digraph.DiGraph.remove_edge
    - A.sum
    - networkx.algorithms.shortest_paths.unweighted._single_shortest_path
    - networkx.utils.decorators.argmap.__init__
    - networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict
    - networkx.algorithms.similarity._simrank_similarity_numpy
    - networkx.algorithms.community.quality.inter_community_non_edges
    - networkx.algorithms.traversal.edgedfs.edge_dfs
    - cs.reverse
    - keys.index
    - networkx.algorithms.centrality.dispersion.dispersion._dispersion
    - networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation
    - networkx.algorithms.dominance.dominance_frontiers
    - networkx.algorithms.cycles._NeighborhoodCache.__init__
    - networkx.algorithms.threshold.is_threshold_sequence
    - networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict
    - networkx.algorithms.bridges.bridges
    - G._pred.items
    - x.intersection
    - networkx.algorithms.richclub.rich_club_coefficient
    - C.edges
    - networkx.classes.graph.Graph.remove_node
    - networkx.find_cliques
    - aug_edges.append
    - next_layer.append
    - networkx.algorithms.polynomials.tutte_polynomial
    - current_sort.pop
    - G.out_degree
    - edge_degrees.pop
    - leftmatches.items
    - G.order
    - networkx.is_weakly_connected
    - networkx.algorithms.tournament.is_reachable.is_closed
    - networkx.algorithms.euler.is_eulerian
    - newsim.copy
    - networkx.algorithms.euler.eulerian_path
    - networkx.algorithms.bipartite.is_bipartite
    - networkx.contracted_edge
    - networkx.algorithms.tournament.score_sequence
    - networkx.utils.py_random_state
    - datadict.copy
    - networkx.classes.multidigraph.MultiDiGraph.out_edges
    - networkx.classes.graph.Graph.subgraph
    - networkx.algorithms.distance_measures.eccentricity
    - G.to_undirected
    - networkx.classes.graph.Graph.nbunch_iter
    - networkx.algorithms.isolate.number_of_isolates
    - networkx.classes.digraph.DiGraph.is_directed
    - cdf.append
    - networkx.algorithms.core.core_number
    - collections.deque.popleft
    - networkx.algorithms.components.biconnected.articulation_points
    - active_nodes.add
    - networkx.algorithms.coloring.greedy_color
    - networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes
    - networkx.algorithms.efficiency_measures.efficiency
    - networkx.algorithms.components.connected.node_connected_component
    - networkx.predecessor
    - networkx.algorithms.distance_regular.is_strongly_regular
    - networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor
    - networkx.algorithms.approximation.matching.min_maximal_matching
    - networkx.algorithms.components.strongly_connected.strongly_connected_components
    - <builtin>.sorted
    - G.graph.update
    - networkx.algorithms.traversal.depth_first_search.dfs_predecessors
    - networkx.convert.from_edgelist
    - <builtin>.sum
    - networkx.algorithms.connectivity.edge_augmentation.collapse
    - networkx.algorithms.broadcasting.tree_broadcast_time
    - networkx.algorithms.centrality.group.group_degree_centrality
    - nbrs_s.isdisjoint
    - vertex_stack.pop
    - networkx.algorithms.dominating.is_dominating_set
    - Y.issubset
    - networkx.dfs_postorder_nodes
    - edges.pop
    - networkx.edge_connectivity
    - networkx.algorithms.traversal.breadth_first_search.descendants_at_distance
    - networkx.algorithms.hybrid.is_kl_connected
    - networkx.algorithms.community.quality.inter_community_edges
    - networkx.algorithms.matching.is_perfect_matching
    - networkx.algorithms.components.biconnected.biconnected_components
    - networkx.algorithms.link_prediction.common_neighbor_centrality.predict
    - networkx.algorithms.bipartite.cluster._threepaths
    - current_sort.append
    - networkx.algorithms.core.onion_layers
    - networkx.algorithms.traversal.depth_first_search.dfs_edges
    - networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation
    - networkx.algorithms.isolate.is_isolate
    - attr.get
    - networkx.algorithms.chains.chain_decomposition._build_chain
    - A.is_strict
    - H.nodes
    - v_neighbors.intersection
    - networkx.algorithms.bipartite.redundancy.node_redundancy
    - networkx.utils.decorators.py_random_state
    - networkx.minimum_edge_cut
    - networkx.algorithms.planarity.LRPlanarity.dfs_orientation
    - networkx.algorithms.cycles._undirected_cycle_search
    - networkx.algorithms.components.weakly_connected._plain_bfs
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - components.pop
    - networkx.algorithms.approximation.kcomponents._AntiGraph.degree
    - length.values
    - networkx.algorithms.link_prediction.preferential_attachment
    - networkx.algorithms.connectivity.edge_augmentation._ordered
    - aux_graph.k_edge_components
    - networkx.classes.digraph.DiGraph.remove_edges_from
    - networkx.algorithms.cycles._bounded_cycle_search
    - networkx.classes.multidigraph.MultiDiGraph.degree
    - math.ceil
    - W.remove
    - G.edges
    - networkx.algorithms.triads.triad_type
    - networkx.algorithms.covering.min_edge_cover
    - scipy.sparse.dia_array
    - clique.intersection
    - <builtin>.round
    - networkx.all_node_cuts
    - networkx.algorithms.components.connected.connected_components
    - networkx.algorithms.centrality.degree_alg.out_degree_centrality
    - X.isdisjoint
    - networkx.algorithms.planarity.PlanarEmbedding.to_undirected
    - path.append
    - networkx.has_path
    - networkx.classes.multigraph.MultiGraph.get_edge_data
    - networkx.algorithms.threshold.is_threshold_graph
    - networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected
    - c.number_of_edges
    - networkx.algorithms.link_prediction.preferential_attachment.predict
    - networkx.classes.graph.Graph.nodes
    - networkx.classes.graph.Graph.__iter__
    - networkx.algorithms.cycles.chordless_cycles.stems
    - dict.fromkeys
    - networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph
    - networkx.empty_graph
    - datadict.items
    - networkx.algorithms.polynomials.chromatic_polynomial
    - networkx.algorithms.link_prediction.resource_allocation_index
    - networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity
    - networkx.linalg.spectrum.bethe_hessian_spectrum
    - networkx.algorithms.coloring.greedy_coloring._AdjEntry.__init__
    - networkx.algorithms.bipartite.cluster.cc_dot
    - col_used.discard
    - numbered.add
    - networkx.algorithms.coloring.greedy_coloring.greedy_color
    - networkx.reverse
    - networkx.classes.digraph.DiGraph.add_node
    - networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
    - pl_u.items
    - networkx.algorithms.connectivity.connectivity.local_edge_connectivity
    - networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from
    - <builtin>.int
    - networkx.algorithms.clique.find_cliques
    - gnodes.popitem
    - <builtin>.reversed
    - C.copy
    - networkx.algorithms.community.quality.partition_quality
    - networkx.algorithms.euler.has_eulerian_path
    - networkx.algorithms.boundary.node_boundary
    - G.in_degree
    - scipy.sparse.linalg.matrix_power
    - networkx.algorithms.connectivity.edge_augmentation._compat_shuffle
    - rng.shuffle
    - networkx.algorithms.regular.is_regular
    - scc_queue.append
    - networkx.algorithms.community.label_propagation.label_propagation_communities
    - d.items
    - networkx.algorithms.traversal.breadth_first_search.bfs_successors
    - networkx.algorithms.approximation.clique.maximum_independent_set
    - networkx.algorithms.coloring.equitable_coloring.is_equitable
    - networkx.bfs_layers
    - networkx.non_edges
    - d.copy
    - networkx.classes.reportviews.InEdgeView.__init__
    - networkx.algorithms.smallworld.sigma
    - G.successors
    - networkx.is_dominating_set
    - networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs
    - networkx.quotient_graph
    - networkx.classes.graph.Graph.number_of_nodes
    - length.items
    - networkx.algorithms.cluster._triangles_and_degree_iter
    - Q.pop
    - H.number_of_nodes
    - networkx.linalg.spectrum.modularity_spectrum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 4
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - degree_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 45
    functionName: networkx.algorithms.threshold.is_threshold_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 191
    functionsReached:
    - ds.pop
    - ds.sort
    - <builtin>.len
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ds.sort
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ds.pop
    functionSourceFile: <builtin>
    functionUses: 195
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 5
    IfCount: 7
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73477a3610>
    - <ast.Constant object at 0x7f73477a35e0>
    argNames:
    - degree_sequence
    - with_labels
    - compact
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 68
    functionName: networkx.algorithms.threshold.creation_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - ds.sort
    - <builtin>.range
    - ccs.append
    - degree_sequence.items
    - networkx.algorithms.threshold.make_compact
    - <builtin>.len
    - <builtin>.enumerate
    - ds.pop
    - cs.insert
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degree_sequence.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cs.insert
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 127
    functionName: networkx.algorithms.threshold.make_compact
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 3
    functionsReached:
    - <builtin>.isinstance
    - <builtin>.len
    - <builtin>.range
    - ccs.append
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ccs.append
    functionSourceFile: <builtin>
    functionUses: 4
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 4
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 7
    ICount: 3
    IfCount: 4
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 171
    functionName: networkx.algorithms.threshold.uncompact
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 5
    functionsReached:
    - <builtin>.isinstance
    - cs.extend
    - ccscopy.pop
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ccscopy.pop
    functionSourceFile: <builtin>
    functionUses: 6
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cs.extend
    functionSourceFile: <builtin>
    functionUses: 197
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 9
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 7
    EdgeCount: 14
    ICount: 3
    IfCount: 9
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 195
    functionName: networkx.algorithms.threshold.creation_sequence_to_weights
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - cs.extend
    - wseq.reverse
    - ccscopy.pop
    - networkx.algorithms.threshold.uncompact
    - <builtin>.list
    - <builtin>.enumerate
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: wseq.reverse
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 6
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 9
    ICount: 6
    IfCount: 6
    argCount: 4
    argDefaultValues:
    - <ast.Constant object at 0x7f734b66e640>
    - <ast.Constant object at 0x7f734cd24520>
    - <ast.Constant object at 0x7f734cd24dc0>
    argNames:
    - weights
    - threshold
    - with_labels
    - compact
    argTypes:
    - N/A
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 242
    functionName: networkx.algorithms.threshold.weights_to_creation_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - cs.reverse
    - <builtin>.range
    - ccs.append
    - wseq.pop
    - networkx.algorithms.threshold.make_compact
    - wseq.sort
    - <builtin>.len
    - weights.items
    - <builtin>.enumerate
    - cs.append
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: weights.items
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: wseq.sort
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: wseq.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cs.append
    functionSourceFile: <builtin>
    functionUses: 194
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cs.reverse
    functionSourceFile: <builtin>
    functionUses: 193
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 5
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 5
    EdgeCount: 8
    ICount: 3
    IfCount: 5
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cbba580>
    argNames:
    - creation_sequence
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 3
    functionLinenumber: 306
    functionName: networkx.algorithms.threshold.threshold_graph
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 1
    functionsReached:
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.enumerate
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - ci.pop
    - datadict.update
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - attr_dict.update
    - ccscopy.pop
    - networkx.algorithms.threshold.uncompact
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - cs.extend
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: ci.pop
    functionSourceFile: <builtin>
    functionUses: 2
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f734cfcbaf0>
    argNames:
    - G
    - create_using
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 4
    functionLinenumber: 373
    functionName: networkx.algorithms.threshold.find_threshold_graph
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - networkx.classes.digraph.DiGraph.add_node
    - keydict.get
    - <builtin>.enumerate
    - H.subgraph
    - networkx.algorithms.planarity.PlanarEmbedding._forbidden
    - cs.reverse
    - ds.sort
    - ci.pop
    - datadict.update
    - networkx.algorithms.threshold.threshold_graph
    - networkx.classes.multidigraph.MultiDiGraph.add_edge
    - networkx.algorithms.threshold.find_creation_sequence
    - networkx.classes.graph.Graph.is_directed
    - <builtin>.len
    - H.neighbors
    - attr_dict.update
    - ccscopy.pop
    - networkx.algorithms.threshold.uncompact
    - H.order
    - <builtin>.list
    - networkx.classes.multidigraph.MultiDiGraph.is_directed
    - cs.append
    - networkx.algorithms.planarity.PlanarEmbedding.is_directed
    - <builtin>.isinstance
    - ds.pop
    - H.degree
    - cs.extend
    - networkx.classes.graph.Graph.add_node
    - networkx.classes.multigraph.MultiGraph.new_edge_key
    - networkx.classes.digraph.DiGraph.is_directed
    - <builtin>.dict
    - networkx.classes.multigraph.MultiGraph.is_directed
    - networkx.empty_graph
    - networkx.algorithms.approximation.kcomponents._AntiGraph.single_edge_dict
    - dsdict.items
    - networkx._clear_cache
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.order
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: dsdict.items
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: H.neighbors
    functionSourceFile: <builtin>
    functionUses: 192
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 1
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 440
    functionName: networkx.algorithms.threshold.triangles
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - cs.count
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cs.count
    functionSourceFile: <builtin>
    functionUses: 8
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 2
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 460
    functionName: networkx.algorithms.threshold.triangle_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 1
    functionsReached:
    - cs.count
    - seq.append
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 488
    functionName: networkx.algorithms.threshold.cluster_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - networkx.algorithms.threshold.triangle_sequence
    - seq.append
    - cseq.append
    - cs.count
    - networkx.algorithms.threshold.degree_sequence
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 1
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 2
    ICount: 3
    IfCount: 1
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 505
    functionName: networkx.algorithms.threshold.degree_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 4
    functionsReached:
    - cs.count
    - seq.append
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cseq.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 1
    IfCount: 0
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 522
    functionName: networkx.algorithms.threshold.density
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - seq.append
    - cs.count
    - networkx.algorithms.threshold.degree_sequence
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 534
    functionName: networkx.algorithms.threshold.degree_correlation
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - seq.append
    - cs.count
    - networkx.algorithms.threshold.degree_sequence
    - <builtin>.enumerate
    - rdi.pop
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: rdi.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 8
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 12
    ICount: 1
    IfCount: 8
    argCount: 3
    argDefaultValues: []
    argNames:
    - creation_sequence
    - u
    - v
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 565
    functionName: networkx.algorithms.threshold.shortest_path
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - cs.pop
    - <builtin>.range
    - cs.extend
    - ccscopy.pop
    - networkx.algorithms.threshold.uncompact
    - <builtin>.max
    - <builtin>.len
    - verts.index
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - ValueError
    - TypeError
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: verts.index
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: cs.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 7
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 6
    EdgeCount: 11
    ICount: 1
    IfCount: 7
    argCount: 2
    argDefaultValues: []
    argNames:
    - creation_sequence
    - i
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 618
    functionName: networkx.algorithms.threshold.shortest_path_length
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - cs.extend
    - ccscopy.pop
    - networkx.algorithms.threshold.uncompact
    - <builtin>.list
    - <builtin>.len
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised:
    - TypeError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 2
    IfCount: 3
    argCount: 2
    argDefaultValues:
    - <ast.Constant object at 0x7f7347bea550>
    argNames:
    - creation_sequence
    - normalized
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 664
    functionName: networkx.algorithms.threshold.betweenness_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - seq.append
    - cs.count
    - <builtin>.len
    - <builtin>.enumerate
    - <builtin>.float
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 704
    functionName: networkx.algorithms.threshold.eigenvectors
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - math.sqrt
    - <builtin>.range
    - ccs.append
    - networkx.algorithms.threshold.make_compact
    - <builtin>.sum
    - <builtin>.len
    - <builtin>.isinstance
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 2
    IfCount: 0
    argCount: 2
    argDefaultValues: []
    argNames:
    - u
    - eigenpairs
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 762
    functionName: networkx.algorithms.threshold.spectral_projection
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - <builtin>.zip
    - coeff.append
    - <builtin>.sum
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: coeff.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 1
    argDefaultValues: []
    argNames:
    - creation_sequence
    argTypes:
    - N/A
    constantsTouched: []
    functionDepth: 2
    functionLinenumber: 783
    functionName: networkx.algorithms.threshold.eigenvalues
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - seq.append
    - cs.count
    - networkx.algorithms.threshold.degree_sequence
    - eiglist.append
    - degseq.sort
    - <builtin>.len
    - degseq.pop
    - <builtin>.enumerate
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degseq.sort
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: degseq.pop
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 0
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 3
    EdgeCount: 1
    ICount: 0
    IfCount: 0
    argCount: 0
    argDefaultValues: []
    argNames: []
    argTypes: []
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: -1
    functionName: eiglist.append
    functionSourceFile: <builtin>
    functionUses: 1
    functionsReached: []
    linkageType: pythonLinkage
    raised: []
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 3
    IfCount: 2
    argCount: 3
    argDefaultValues:
    - <ast.Constant object at 0x7f73462952b0>
    argNames:
    - n
    - p
    - seed
    argTypes:
    - N/A
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 1
    functionLinenumber: 826
    functionName: networkx.algorithms.threshold.random_threshold_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached:
    - <builtin>.range
    - seed.random
    - cs.append
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 2
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 4
    ICount: 1
    IfCount: 2
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - m
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 860
    functionName: networkx.algorithms.threshold.right_d_threshold_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  - BBCount: 3
    BranchProfiles: []
    Callsites: []
    CyclomaticComplexity: 4
    EdgeCount: 5
    ICount: 1
    IfCount: 3
    argCount: 2
    argDefaultValues: []
    argNames:
    - n
    - m
    argTypes:
    - N/A
    - N/A
    constantsTouched: []
    functionDepth: 0
    functionLinenumber: 915
    functionName: networkx.algorithms.threshold.left_d_threshold_sequence
    functionSourceFile: networkx.algorithms.threshold
    functionUses: 0
    functionsReached: []
    linkageType: pythonLinkage
    raised:
    - ValueError
    returnType: N/A
  Function list name: All functions
Function coverage:
  '...fuzz_graphml':
  - 40
  - 39
  '...fuzz_graphml.TestOneInput':
  - 23
  '...fuzz_graphml.main':
  - 34
  - 35
  - 36
  networkx:
  - 1
  - 23
  networkx.__getattr__:
  - 57
  networkx.algorithms.approximation:
  - 1
  networkx.algorithms.approximation.clique:
  - 1
  - 131
  - 132
  - 72
  - 73
  - 15
  - 16
  - 184
  - 185
  networkx.algorithms.approximation.clique.clique_removal:
  - 135
  - 168
  - 169
  - 173
  - 174
  - 175
  - 176
  - 177
  - 178
  - 180
  networkx.algorithms.approximation.clique.large_clique_size:
  - 256
  - 258
  - 188
  networkx.algorithms.approximation.clique.large_clique_size._clique_heuristic:
  - 247
  - 248
  - 249
  - 250
  - 252
  networkx.algorithms.approximation.clique.max_clique:
  - 76
  - 126
  - 127
  networkx.algorithms.approximation.clique.maximum_independent_set:
  - 19
  - 68
  networkx.algorithms.approximation.clustering_coefficient:
  - 8
  - 9
  - 7
  networkx.algorithms.approximation.clustering_coefficient.average_clustering:
  - 64
  - 65
  - 66
  - 68
  - 69
  - 11
  - 61
  - 63
  networkx.algorithms.approximation.connectivity:
  - 1
  - 111
  - 217
  - 15
  networkx.algorithms.approximation.connectivity._bidirectional_pred_succ:
  - 387
  - 390
  - 391
  - 392
  - 394
  - 395
  - 365
  - 397
  - 402
  - 403
  - 404
  - 406
  - 408
  - 409
  networkx.algorithms.approximation.connectivity._bidirectional_shortest_path:
  - 354
  - 298
  - 341
  - 348
  - 350
  networkx.algorithms.approximation.connectivity.all_pairs_node_connectivity:
  - 288
  - 289
  - 291
  - 275
  - 278
  - 280
  - 281
  - 219
  networkx.algorithms.approximation.connectivity.local_node_connectivity:
  - 96
  - 97
  - 99
  - 100
  - 102
  - 103
  - 17
  - 83
  - 87
  - 88
  - 90
  - 93
  networkx.algorithms.approximation.connectivity.node_connectivity:
  - 199
  - 203
  - 175
  - 208
  - 113
  - 209
  - 179
  - 180
  - 211
  - 182
  - 212
  - 184
  - 213
  - 187
  networkx.algorithms.approximation.connectivity.node_connectivity.neighbors:
  - 192
  networkx.algorithms.approximation.density:
  - 1
  - 214
  - 215
  networkx.algorithms.approximation.density._fista:
  - 131
  - 132
  - 133
  - 140
  - 141
  - 142
  - 146
  - 148
  - 151
  - 152
  - 154
  - 158
  - 159
  - 160
  - 161
  - 165
  - 170
  - 175
  - 178
  - 184
  - 188
  - 205
  - 208
  networkx.algorithms.approximation.density._fractional_peeling:
  - 96
  - 98
  - 67
  - 101
  - 104
  - 107
  - 109
  - 112
  - 114
  - 117
  - 118
  - 90
  - 123
  - 92
  - 125
  - 95
  networkx.algorithms.approximation.density._greedy_plus_plus:
  - 11
  - 12
  - 13
  - 20
  - 22
  - 24
  - 27
  - 28
  - 30
  - 31
  - 32
  - 35
  - 41
  - 43
  - 46
  - 47
  - 54
  - 55
  - 58
  - 61
  networkx.algorithms.approximation.density.densest_subgraph:
  - 218
  - 396
  networkx.algorithms.approximation.distance_measures:
  - 1
  - 10
  - 9
  networkx.algorithms.approximation.distance_measures._two_sweep_directed:
  - 133
  - 135
  - 137
  - 139
  - 142
  - 143
  - 114
  - 150
  networkx.algorithms.approximation.distance_measures._two_sweep_undirected:
  - 101
  - 103
  - 105
  - 110
  - 88
  networkx.algorithms.approximation.distance_measures.diameter:
  - 75
  - 12
  - 78
  - 81
  - 82
  - 84
  networkx.algorithms.approximation.dominating_set:
  - 24
  - 1
  - 23
  networkx.algorithms.approximation.dominating_set.min_edge_dominating_set:
  - 147
  - 149
  - 118
  networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set:
  - 96
  - 99
  - 106
  - 77
  - 78
  - 109
  - 81
  - 26
  networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set._cost:
  - 84
  - 92
  networkx.algorithms.approximation.kcomponents:
  - 16
  - 1
  - 17
  networkx.algorithms.approximation.kcomponents._AntiGraph:
  - 198
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView:
  - 267
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__getitem__:
  - 280
  - 282
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__iter__:
  - 277
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView.__len__:
  - 274
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView:
  - 247
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__getitem__:
  - 261
  - 262
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView.__len__:
  - 255
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiDegreeView.__getitem__:
  - 313
  - 311
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiDegreeView.__iter__:
  - 305
  - 306
  - 307
  - 308
  networkx.algorithms.approximation.kcomponents._AntiGraph.__getitem__:
  - 234
  - 219
  networkx.algorithms.approximation.kcomponents._AntiGraph.adj:
  - 286
  networkx.algorithms.approximation.kcomponents._AntiGraph.adjacency:
  - 368
  - 369
  - 355
  networkx.algorithms.approximation.kcomponents._AntiGraph.degree:
  - 352
  - 317
  networkx.algorithms.approximation.kcomponents._AntiGraph.neighbors:
  - 242
  - 238
  networkx.algorithms.approximation.kcomponents._AntiGraph.subgraph:
  - 289
  - 290
  - 291
  - 292
  - 293
  - 294
  - 296
  - 297
  networkx.algorithms.approximation.kcomponents._cliques_heuristic:
  - 160
  - 161
  - 162
  - 164
  - 167
  - 170
  - 171
  - 173
  - 174
  - 175
  - 176
  - 178
  - 179
  - 181
  - 182
  - 183
  - 184
  - 185
  - 187
  networkx.algorithms.approximation.kcomponents._same:
  - 192
  - 191
  networkx.algorithms.approximation.kcomponents.k_components:
  - 129
  - 130
  - 131
  - 132
  - 133
  - 136
  - 138
  - 140
  - 141
  - 142
  - 143
  - 144
  - 145
  - 146
  - 19
  - 147
  - 149
  - 150
  - 151
  - 152
  - 153
  - 155
  - 107
  - 117
  - 119
  - 120
  - 121
  - 122
  - 124
  - 125
  - 126
  networkx.algorithms.approximation.matching:
  - 1
  networkx.algorithms.approximation.matching.min_maximal_matching:
  - 19
  - 44
  networkx.algorithms.approximation.maxcut:
  - 67
  - 68
  - 69
  - 70
  - 7
  - 8
  - 9
  - 10
  networkx.algorithms.approximation.maxcut._swap_node_partition:
  - 64
  networkx.algorithms.approximation.maxcut.one_exchange:
  - 128
  - 133
  - 134
  - 72
  - 136
  - 118
  - 119
  - 120
  - 121
  - 123
  - 125
  - 126
  networkx.algorithms.approximation.maxcut.one_exchange.<lambda1>:
  - 128
  - 129
  networkx.algorithms.approximation.maxcut.randomized_partitioning:
  - 57
  - 58
  - 12
  networkx.algorithms.approximation.ramsey:
  - 1
  - 13
  - 14
  networkx.algorithms.approximation.ramsey.ramsey_R2:
  - 40
  - 41
  - 43
  - 44
  - 45
  - 46
  - 47
  - 17
  - 49
  - 50
  - 53
  networkx.algorithms.approximation.steinertree:
  - 9
  - 10
  - 173
  - 174
  networkx.algorithms.approximation.steinertree._kou_steiner_tree:
  - 128
  - 131
  - 132
  - 134
  - 139
  - 140
  - 143
  - 144
  - 146
  - 108
  - 109
  - 112
  - 113
  - 114
  - 117
  - 118
  - 121
  - 122
  - 123
  - 124
  - 125
  networkx.algorithms.approximation.steinertree._kou_steiner_tree.<lambda1>:
  - 134
  networkx.algorithms.approximation.steinertree._mehlhorn_steiner_tree:
  - 66
  - 70
  - 75
  - 77
  - 79
  - 80
  - 81
  - 83
  - 84
  - 86
  - 88
  - 89
  - 90
  - 91
  - 92
  - 94
  - 95
  - 97
  - 100
  - 101
  - 102
  networkx.algorithms.approximation.steinertree._mehlhorn_steiner_tree.<lambda1>:
  - 97
  networkx.algorithms.approximation.steinertree._remove_nonterminal_leaves:
  - 161
  - 163
  - 150
  - 151
  - 158
  networkx.algorithms.approximation.steinertree.metric_closure:
  - 35
  - 42
  - 12
  - 44
  - 47
  - 48
  - 49
  - 52
  - 53
  - 54
  - 57
  - 58
  - 59
  - 60
  networkx.algorithms.approximation.steinertree.steiner_tree:
  - 258
  - 260
  - 262
  - 264
  - 176
  - 250
  networkx.algorithms.approximation.traveling_salesman:
  - 128
  - 1
  - 1279
  - 358
  - 359
  - 360
  - 201
  - 519
  - 945
  - 1048
  - 1049
  - 1278
  - 127
  networkx.algorithms.approximation.traveling_salesman._shortcutting:
  - 192
  - 194
  - 195
  - 196
  - 197
  - 189
  - 191
  networkx.algorithms.approximation.traveling_salesman.asadpour_atsp:
  - 512
  - 515
  - 516
  - 440
  - 441
  - 444
  - 447
  - 450
  - 451
  - 452
  - 453
  - 455
  - 460
  - 463
  - 466
  - 467
  - 468
  - 469
  - 470
  - 473
  - 476
  - 477
  - 478
  - 484
  - 485
  - 486
  - 487
  - 488
  - 362
  - 492
  - 493
  - 494
  - 495
  - 497
  - 500
  - 501
  - 504
  - 507
  - 508
  - 509
  - 511
  networkx.algorithms.approximation.traveling_salesman.christofides:
  - 162
  - 130
  - 164
  - 168
  - 169
  - 170
  - 172
  - 174
  - 177
  - 178
  - 179
  - 180
  - 181
  - 182
  - 183
  - 184
  - 185
  networkx.algorithms.approximation.traveling_salesman.greedy_tsp:
  - 1025
  - 1028
  - 1029
  - 1031
  - 1032
  - 1035
  - 1036
  - 1041
  - 1042
  - 947
  - 1043
  - 1044
  - 1023
  networkx.algorithms.approximation.traveling_salesman.greedy_tsp.<lambda1>:
  - 1041
  networkx.algorithms.approximation.traveling_salesman.held_karp_ascent:
  - 521
  - 780
  - 784
  - 786
  - 788
  - 789
  - 791
  - 793
  - 794
  - 802
  - 803
  - 806
  - 812
  - 813
  - 816
  - 817
  - 824
  - 825
  - 827
  - 831
  networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.direction_of_ascent:
  - 672
  - 704
  - 705
  - 706
  - 676
  - 709
  - 710
  - 714
  - 683
  - 653
  - 685
  - 687
  - 692
  - 695
  - 700
  - 701
  - 702
  - 703
  networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.find_epsilon:
  - 768
  - 771
  - 740
  - 741
  - 772
  - 759
  - 751
  - 721
  - 753
  - 754
  - 755
  - 756
  - 757
  - 758
  - 762
  - 764
  - 765
  networkx.algorithms.approximation.traveling_salesman.held_karp_ascent.k_pi:
  - 642
  - 643
  - 646
  - 647
  - 648
  - 569
  - 578
  - 579
  - 583
  - 584
  - 596
  - 597
  - 599
  - 602
  - 607
  - 608
  - 609
  - 611
  - 616
  - 617
  - 619
  - 629
  - 630
  - 632
  - 634
  - 635
  - 636
  networkx.algorithms.approximation.traveling_salesman.move_one_node:
  - 89
  - 122
  - 123
  networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp:
  - 1062
  - 1214
  - 1216
  - 1218
  - 1220
  - 1221
  - 1225
  - 1226
  - 1228
  - 1230
  - 1233
  - 1237
  - 1239
  - 1242
  - 1243
  - 1247
  - 1250
  - 1254
  - 1255
  - 1256
  - 1258
  - 1263
  - 1265
  - 1269
  - 1270
  networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution:
  - 898
  - 836
  - 934
  - 938
  - 939
  - 914
  - 916
  - 918
  - 919
  - 925
  - 927
  networkx.algorithms.approximation.traveling_salesman.spanning_tree_distribution.q:
  - 867
  - 886
  - 887
  - 888
  - 889
  - 890
  - 894
  networkx.algorithms.approximation.traveling_salesman.swap_two_nodes:
  - 83
  - 54
  networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp:
  - 1292
  - 1449
  - 1451
  - 1453
  - 1455
  - 1456
  - 1460
  - 1461
  - 1463
  - 1465
  - 1468
  - 1472
  - 1474
  - 1477
  - 1478
  - 1482
  - 1485
  - 1490
  - 1491
  - 1492
  - 1494
  - 1501
  - 1503
  - 1505
  networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem:
  - 312
  - 313
  - 317
  - 318
  - 322
  - 326
  - 328
  - 330
  - 332
  - 205
  - 333
  - 334
  - 335
  - 339
  - 341
  - 343
  - 345
  - 346
  - 348
  - 352
  - 353
  - 354
  networkx.algorithms.approximation.treewidth:
  - 1
  - 66
  - 67
  - 68
  - 42
  - 43
  - 44
  - 183
  networkx.algorithms.approximation.treewidth.MinDegreeHeuristic:
  - 89
  networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.__init__:
  - 104
  - 107
  - 108
  - 109
  networkx.algorithms.approximation.treewidth.MinDegreeHeuristic.best_node:
  - 113
  - 115
  - 119
  - 120
  - 123
  networkx.algorithms.approximation.treewidth.min_fill_in_heuristic:
  - 162
  - 165
  - 136
  - 168
  - 169
  - 174
  - 175
  - 147
  - 155
  - 156
  - 159
  networkx.algorithms.approximation.treewidth.min_fill_in_heuristic.<lambda1>:
  - 155
  networkx.algorithms.approximation.treewidth.treewidth_decomp:
  - 185
  - 199
  - 205
  - 209
  - 210
  - 211
  - 214
  - 217
  - 218
  - 221
  - 224
  - 225
  - 226
  - 228
  - 232
  - 236
  - 237
  - 241
  - 246
  - 247
  - 250
  - 253
  networkx.algorithms.approximation.treewidth.treewidth_min_degree:
  - 62
  - 46
  - 63
  networkx.algorithms.approximation.treewidth.treewidth_min_degree.<lambda1>:
  - 63
  networkx.algorithms.approximation.treewidth.treewidth_min_fill_in:
  - 85
  - 70
  networkx.algorithms.approximation.vertex_cover:
  - 16
  - 1
  networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover:
  - 70
  - 73
  - 74
  - 75
  - 77
  - 78
  - 81
  - 18
  networkx.algorithms.assortativity.connectivity:
  - 8
  networkx.algorithms.assortativity.connectivity.average_degree_connectivity:
  - 12
  - 77
  - 78
  - 80
  - 95
  - 103
  - 104
  - 106
  - 107
  - 108
  - 109
  - 110
  - 111
  - 112
  - 114
  - 115
  - 117
  - 118
  - 122
  networkx.algorithms.assortativity.correlation:
  - 1
  - 162
  - 103
  - 209
  - 18
  networkx.algorithms.assortativity.correlation._numeric_ac:
  - 291
  - 292
  - 293
  - 295
  - 296
  - 297
  - 298
  - 299
  - 300
  - 301
  - 302
  networkx.algorithms.assortativity.correlation.attribute_ac:
  - 260
  - 278
  - 279
  - 280
  - 281
  - 283
  networkx.algorithms.assortativity.correlation.attribute_assortativity_coefficient:
  - 164
  - 205
  - 206
  networkx.algorithms.assortativity.correlation.degree_assortativity_coefficient:
  - 97
  - 98
  - 100
  - 77
  - 82
  - 20
  - 84
  - 86
  - 89
  - 91
  - 93
  - 95
  networkx.algorithms.assortativity.correlation.degree_pearson_correlation_coefficient:
  - 105
  - 157
  - 158
  - 159
  networkx.algorithms.assortativity.correlation.numeric_assortativity_coefficient:
  - 256
  - 211
  - 251
  - 254
  - 255
  networkx.algorithms.assortativity.mixing:
  - 1
  - 18
  - 117
  - 149
  - 57
  networkx.algorithms.assortativity.mixing.attribute_mixing_dict:
  - 20
  - 53
  - 54
  networkx.algorithms.assortativity.mixing.attribute_mixing_matrix:
  - 110
  - 111
  - 112
  - 113
  - 59
  networkx.algorithms.assortativity.mixing.degree_mixing_dict:
  - 145
  - 146
  - 119
  networkx.algorithms.assortativity.mixing.degree_mixing_matrix:
  - 217
  - 214
  - 215
  - 216
  - 153
  networkx.algorithms.assortativity.mixing.mixing_dict:
  - 242
  - 243
  - 245
  - 247
  - 251
  - 252
  - 253
  - 222
  networkx.algorithms.assortativity.neighbor_degree:
  - 6
  networkx.algorithms.assortativity.neighbor_degree.average_neighbor_degree:
  - 131
  - 133
  - 8
  - 136
  - 144
  - 146
  - 151
  - 153
  - 157
  - 158
  - 97
  - 98
  - 100
  - 102
  - 109
  - 111
  - 113
  - 120
  - 127
  networkx.algorithms.assortativity.pairs:
  - 8
  - 1
  - 68
  networkx.algorithms.assortativity.pairs.node_attribute_xy:
  - 64
  - 65
  - 10
  - 48
  - 49
  - 51
  - 53
  - 54
  - 56
  - 57
  - 58
  - 59
  - 60
  - 61
  - 63
  networkx.algorithms.assortativity.pairs.node_degree_xy:
  - 70
  - 115
  - 116
  - 123
  - 125
  - 126
  - 127
  networkx.algorithms.asteroidal:
  - 1
  - 20
  - 21
  - 86
  - 87
  - 120
  - 121
  networkx.algorithms.asteroidal.create_component_structure:
  - 156
  - 147
  - 149
  - 151
  - 153
  - 124
  - 157
  - 159
  networkx.algorithms.asteroidal.find_asteroidal_triple:
  - 67
  - 69
  - 70
  - 71
  - 72
  - 73
  - 77
  - 24
  - 61
  - 63
  networkx.algorithms.asteroidal.is_at_free:
  - 90
  - 117
  networkx.algorithms.bipartite:
  - 1
  networkx.algorithms.bipartite.basic:
  - 1
  - 225
  - 278
  networkx.algorithms.bipartite.basic.color:
  - 67
  - 68
  - 73
  - 75
  - 76
  - 77
  - 81
  - 83
  - 23
  - 57
  networkx.algorithms.bipartite.basic.color.neighbors:
  - 61
  networkx.algorithms.bipartite.basic.degrees:
  - 280
  - 321
  - 322
  - 320
  networkx.algorithms.bipartite.basic.density:
  - 227
  - 264
  - 265
  - 266
  - 268
  - 271
  networkx.algorithms.bipartite.basic.is_bipartite:
  - 89
  - 107
  networkx.algorithms.bipartite.basic.is_bipartite_node_set:
  - 139
  - 141
  - 115
  - 149
  - 150
  - 151
  - 152
  networkx.algorithms.bipartite.basic.sets:
  - 160
  - 208
  - 212
  - 213
  - 214
  - 216
  - 219
  - 220
  - 221
  networkx.algorithms.bipartite.centrality:
  - 81
  - 185
  - 6
  networkx.algorithms.bipartite.centrality.betweenness_centrality:
  - 161
  - 162
  - 163
  - 164
  - 165
  - 171
  - 177
  - 178
  - 83
  - 180
  networkx.algorithms.bipartite.centrality.closeness_centrality:
  - 266
  - 267
  - 268
  - 269
  - 270
  - 271
  - 272
  - 273
  - 283
  - 275
  - 276
  - 280
  - 281
  - 282
  - 187
  - 285
  - 286
  networkx.algorithms.bipartite.centrality.degree_centrality:
  - 8
  - 73
  - 74
  - 72
  - 75
  - 76
  - 77
  networkx.algorithms.bipartite.cluster:
  - 1
  - 135
  networkx.algorithms.bipartite.cluster._four_cycles:
  - 265
  - 267
  - 268
  - 269
  - 270
  - 273
  - 275
  - 276
  networkx.algorithms.bipartite.cluster._threepaths:
  - 283
  - 284
  - 285
  - 286
  networkx.algorithms.bipartite.cluster.average_clustering:
  - 208
  - 137
  - 209
  - 206
  networkx.algorithms.bipartite.cluster.cc_dot:
  - 16
  networkx.algorithms.bipartite.cluster.cc_max:
  - 20
  networkx.algorithms.bipartite.cluster.cc_min:
  - 24
  networkx.algorithms.bipartite.cluster.latapy_clustering:
  - 32
  - 108
  - 118
  - 121
  - 124
  - 125
  - 126
  - 127
  networkx.algorithms.bipartite.cluster.robins_alexander_clustering:
  - 256
  - 258
  - 214
  - 253
  - 255
  networkx.algorithms.bipartite.covering:
  - 1
  - 11
  - 12
  - 13
  networkx.algorithms.bipartite.covering.min_edge_cover:
  - 15
  - 53
  - 54
  - 55
  - 57
  networkx.algorithms.bipartite.edgelist:
  - 32
  - 1
  - 271
  - 272
  - 82
  - 150
  networkx.algorithms.bipartite.edgelist.generate_edgelist:
  - 132
  - 135
  - 136
  - 137
  - 138
  - 140
  - 141
  - 144
  - 147
  - 84
  networkx.algorithms.bipartite.edgelist.parse_edgelist:
  - 256
  - 258
  - 264
  - 265
  - 266
  - 267
  - 154
  - 215
  - 216
  - 217
  - 218
  - 220
  - 223
  - 224
  - 226
  - 227
  - 229
  - 231
  - 232
  - 238
  - 241
  - 244
  - 251
  networkx.algorithms.bipartite.edgelist.read_edgelist:
  - 352
  - 353
  - 283
  networkx.algorithms.bipartite.edgelist.write_edgelist:
  - 34
  - 77
  - 79
  networkx.algorithms.bipartite.extendability:
  - 1
  - 10
  - 11
  networkx.algorithms.bipartite.extendability.maximal_extendability:
  - 68
  - 100
  - 101
  - 71
  - 102
  - 103
  - 74
  - 76
  - 14
  - 78
  - 82
  - 91
  - 92
  - 93
  - 95
  networkx.algorithms.bipartite.generators:
  - 1
  - 291
  - 217
  - 70
  - 71
  - 441
  - 142
  - 528
  - 369
  - 370
  - 529
  - 24
  - 25
  - 442
  networkx.algorithms.bipartite.generators._add_nodes_with_bipartite_label:
  - 600
  - 601
  - 602
  - 599
  networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph:
  - 293
  - 325
  - 326
  - 330
  - 331
  - 332
  - 333
  - 335
  - 340
  - 342
  - 345
  - 346
  - 348
  - 349
  - 350
  - 352
  - 355
  - 356
  - 357
  - 358
  - 360
  - 362
  - 363
  networkx.algorithms.bipartite.generators.complete_bipartite_graph:
  - 65
  - 66
  - 27
  - 53
  - 54
  - 59
  - 61
  - 62
  - 63
  networkx.algorithms.bipartite.generators.configuration_model:
  - 129
  - 133
  - 134
  - 136
  - 73
  - 106
  - 105
  - 110
  - 111
  - 112
  - 113
  - 115
  - 120
  - 122
  - 126
  networkx.algorithms.bipartite.generators.gnmk_random_graph:
  - 577
  - 580
  - 581
  - 583
  - 584
  - 588
  - 589
  - 590
  - 593
  - 531
  - 572
  - 573
  - 574
  - 575
  networkx.algorithms.bipartite.generators.havel_hakimi_graph:
  - 144
  - 175
  - 176
  - 180
  - 181
  - 183
  - 184
  - 186
  - 191
  - 193
  - 197
  - 198
  - 199
  - 201
  - 202
  - 205
  - 206
  - 208
  - 210
  - 211
  networkx.algorithms.bipartite.generators.preferential_attachment_graph:
  - 417
  - 418
  - 419
  - 423
  - 424
  - 425
  - 426
  - 427
  - 429
  - 431
  - 433
  - 434
  - 435
  - 372
  - 436
  - 410
  - 411
  - 414
  networkx.algorithms.bipartite.generators.random_graph:
  - 517
  - 518
  - 487
  - 488
  - 489
  - 490
  - 522
  - 523
  - 493
  - 508
  - 495
  - 496
  - 498
  - 503
  - 504
  - 444
  - 509
  - 511
  networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph:
  - 256
  - 257
  - 258
  - 260
  - 265
  - 267
  - 271
  - 272
  - 273
  - 274
  - 276
  - 277
  - 280
  - 282
  - 284
  - 285
  - 219
  - 250
  - 251
  - 255
  networkx.algorithms.bipartite.link_analysis:
  - 8
  networkx.algorithms.bipartite.link_analysis._clean_personalization_dict:
  - 312
  - 314
  - 316
  - 310
  networkx.algorithms.bipartite.link_analysis.birank:
  - 258
  - 259
  - 263
  - 265
  - 266
  - 270
  - 274
  - 21
  - 278
  - 286
  - 287
  - 289
  - 290
  - 295
  - 296
  - 297
  - 301
  - 302
  - 223
  - 224
  - 225
  - 226
  - 228
  - 235
  - 236
  - 239
  - 241
  - 244
  - 246
  - 250
  - 251
  - 254
  - 255
  networkx.algorithms.bipartite.matching:
  - 505
  - 11
  - 55
  networkx.algorithms.bipartite.matching._connected_by_alternating_paths:
  - 418
  - 387
  - 408
  - 409
  - 411
  networkx.algorithms.bipartite.matching._is_connected_by_alternating_path:
  - 381
  - 325
  networkx.algorithms.bipartite.matching._is_connected_by_alternating_path._alternating_dfs:
  - 358
  - 362
  - 367
  - 368
  - 369
  - 370
  - 372
  - 373
  - 375
  - 348
  networkx.algorithms.bipartite.matching.eppstein_matching:
  - 256
  - 261
  - 262
  - 263
  - 264
  - 266
  - 268
  - 269
  - 272
  - 275
  - 303
  - 187
  - 320
  - 321
  - 235
  - 236
  - 239
  - 240
  - 241
  - 254
  networkx.algorithms.bipartite.matching.eppstein_matching.recurse:
  - 310
  - 311
  - 312
  - 313
  - 314
  - 315
  networkx.algorithms.bipartite.matching.hopcroft_karp_matching:
  - 161
  - 166
  - 167
  - 168
  - 169
  - 173
  - 174
  - 182
  - 60
  - 157
  networkx.algorithms.bipartite.matching.hopcroft_karp_matching.breadth_first_search:
  - 128
  - 129
  - 131
  - 136
  - 137
  - 138
  - 139
  - 141
  networkx.algorithms.bipartite.matching.hopcroft_karp_matching.depth_first_search:
  - 145
  - 146
  - 147
  - 148
  networkx.algorithms.bipartite.matching.minimum_weight_full_matching:
  - 576
  - 580
  - 583
  - 585
  - 586
  - 589
  - 507
  - 574
  - 575
  networkx.algorithms.bipartite.matching.to_vertex_cover:
  - 489
  - 426
  - 493
  - 487
  networkx.algorithms.bipartite.matrix:
  - 1
  - 114
  - 15
  networkx.algorithms.bipartite.matrix.biadjacency_matrix:
  - 97
  - 100
  - 102
  - 103
  - 107
  - 109
  - 81
  - 82
  - 19
  - 84
  - 87
  - 88
  - 89
  - 90
  - 94
  - 95
  networkx.algorithms.bipartite.matrix.from_biadjacency_matrix:
  - 164
  - 166
  - 167
  - 116
  - 151
  - 154
  - 155
  - 158
  networkx.algorithms.bipartite.projection:
  - 224
  - 1
  - 417
  - 418
  - 16
  - 122
  - 123
  - 317
  - 318
  - 223
  networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph:
  - 226
  - 298
  - 300
  - 303
  - 304
  - 305
  - 306
  - 307
  - 309
  - 310
  - 311
  - 312
  - 313
  networkx.algorithms.bipartite.projection.generic_weighted_projected_graph:
  - 512
  - 513
  - 420
  - 519
  - 520
  - 521
  - 522
  - 523
  - 524
  - 525
  - 507
  - 509
  networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.weight_function:
  - 517
  networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph:
  - 320
  - 396
  - 398
  - 401
  - 402
  - 403
  - 404
  - 405
  - 407
  - 408
  - 409
  - 410
  - 412
  - 413
  networkx.algorithms.bipartite.projection.projected_graph:
  - 20
  - 90
  - 92
  - 94
  - 95
  - 97
  - 100
  - 101
  - 103
  - 104
  - 105
  - 106
  - 108
  - 109
  - 110
  - 111
  - 113
  - 114
  - 115
  - 116
  - 118
  networkx.algorithms.bipartite.projection.weighted_projected_graph:
  - 193
  - 195
  - 198
  - 199
  - 200
  - 201
  - 203
  - 209
  - 210
  - 212
  - 213
  - 215
  - 216
  - 218
  - 219
  - 125
  networkx.algorithms.bipartite.redundancy:
  - 1
  networkx.algorithms.bipartite.redundancy._node_redundancy:
  - 98
  - 108
  - 109
  - 110
  networkx.algorithms.bipartite.redundancy.node_redundancy:
  - 88
  - 94
  - 13
  - 86
  networkx.algorithms.bipartite.spectral:
  - 1
  - 10
  networkx.algorithms.bipartite.spectral.spectral_bipartivity:
  - 64
  - 66
  - 68
  - 12
  - 54
  - 55
  - 56
  - 57
  - 59
  - 61
  networkx.algorithms.boundary:
  - 1
  - 19
  networkx.algorithms.boundary.edge_boundary:
  - 100
  - 102
  - 21
  - 92
  - 93
  - 95
  networkx.algorithms.boundary.node_boundary:
  - 112
  - 163
  - 166
  - 167
  networkx.algorithms.bridges:
  - 1
  - 11
  - 143
  - 144
  - 145
  - 83
  networkx.algorithms.bridges.bridges:
  - 70
  - 71
  - 72
  - 73
  - 74
  - 75
  - 76
  - 77
  - 14
  - 78
  - 80
  networkx.algorithms.bridges.has_bridges:
  - 136
  - 86
  networkx.algorithms.bridges.local_bridges:
  - 192
  - 193
  - 202
  - 203
  - 205
  - 147
  - 186
  - 187
  - 188
  - 189
  - 191
  networkx.algorithms.bridges.local_bridges.hide_edge:
  - 197
  - 198
  networkx.algorithms.broadcasting:
  - 1
  - 35
  - 36
  - 110
  - 111
  networkx.algorithms.broadcasting._get_broadcast_centers:
  - 32
  - 30
  - 31
  networkx.algorithms.broadcasting._get_max_broadcast_value:
  - 25
  - 26
  networkx.algorithms.broadcasting.tree_broadcast_center:
  - 39
  - 71
  - 74
  - 75
  - 80
  - 81
  - 85
  - 88
  - 90
  - 91
  - 94
  - 95
  - 96
  - 99
  - 101
  - 102
  - 105
  - 106
  - 107
  networkx.algorithms.broadcasting.tree_broadcast_time:
  - 160
  - 161
  - 162
  - 163
  - 114
  - 156
  - 159
  networkx.algorithms.centrality.betweenness:
  - 1
  - 558
  - 16
  - 17
  - 244
  - 245
  networkx.algorithms.centrality.betweenness._accumulate_basic:
  - 457
  - 459
  - 461
  - 463
  networkx.algorithms.centrality.betweenness._accumulate_edges:
  - 482
  - 484
  - 486
  - 488
  - 493
  networkx.algorithms.centrality.betweenness._accumulate_endpoints:
  - 469
  - 470
  - 472
  - 474
  - 476
  networkx.algorithms.centrality.betweenness._add_edge_keys:
  - 580
  - 582
  - 583
  - 585
  - 586
  - 587
  - 588
  - 560
  networkx.algorithms.centrality.betweenness._rescale:
  - 514
  - 516
  - 552
  - 553
  - 522
  - 533
  - 534
  - 503
  - 508
  - 543
  networkx.algorithms.centrality.betweenness._single_source_dijkstra_path_basic:
  - 450
  - 452
  - 423
  - 427
  - 429
  - 433
  - 435
  - 437
  - 438
  - 441
  - 443
  - 444
  - 445
  - 447
  networkx.algorithms.centrality.betweenness._single_source_shortest_path_basic:
  - 416
  - 418
  - 400
  - 402
  - 406
  - 408
  - 409
  - 412
  - 413
  - 414
  networkx.algorithms.centrality.betweenness.betweenness_centrality:
  - 224
  - 226
  - 228
  - 229
  - 231
  - 233
  - 235
  - 237
  - 213
  - 21
  - 214
  - 217
  - 220
  - 221
  - 223
  networkx.algorithms.centrality.betweenness.edge_betweenness_centrality:
  - 384
  - 386
  - 389
  - 390
  - 364
  - 366
  - 367
  - 370
  - 371
  - 373
  - 374
  - 247
  - 376
  - 378
  - 380
  - 382
  networkx.algorithms.centrality.betweenness_subset:
  - 1
  - 115
  - 21
  networkx.algorithms.centrality.betweenness_subset._accumulate_edges_subset:
  - 224
  - 225
  - 228
  - 229
  - 234
  - 219
  - 220
  - 221
  - 223
  networkx.algorithms.centrality.betweenness_subset._accumulate_subset:
  - 203
  - 204
  - 206
  - 207
  - 211
  - 213
  networkx.algorithms.centrality.betweenness_subset.betweenness_centrality_subset:
  - 101
  - 102
  - 104
  - 105
  - 107
  - 108
  - 109
  - 110
  - 23
  networkx.algorithms.centrality.betweenness_subset.edge_betweenness_centrality_subset:
  - 192
  - 193
  - 194
  - 196
  - 197
  - 198
  - 119
  - 185
  - 186
  - 187
  - 189
  - 190
  networkx.algorithms.centrality.closeness:
  - 1
  - 140
  - 141
  - 14
  networkx.algorithms.centrality.closeness.closeness_centrality:
  - 128
  - 129
  - 131
  - 132
  - 135
  - 107
  - 108
  - 110
  - 16
  - 112
  - 118
  - 123
  - 124
  - 125
  - 126
  networkx.algorithms.centrality.closeness.incremental_closeness_centrality:
  - 256
  - 258
  - 260
  - 261
  - 264
  - 265
  - 266
  - 268
  - 269
  - 271
  - 272
  - 145
  - 277
  - 278
  - 280
  - 235
  - 242
  - 244
  - 245
  - 247
  - 249
  - 252
  - 253
  - 255
  networkx.algorithms.centrality.current_flow_betweenness:
  - 1
  - 264
  - 169
  - 170
  - 265
  - 23
  - 24
  - 25
  networkx.algorithms.centrality.current_flow_betweenness.approximate_current_flow_betweenness_centrality:
  - 130
  - 131
  - 140
  - 143
  - 144
  - 145
  - 146
  - 147
  - 149
  - 150
  - 151
  - 154
  - 155
  - 156
  - 158
  - 159
  - 160
  - 161
  - 38
  - 166
  - 112
  - 115
  - 119
  - 120
  - 122
  - 125
  networkx.algorithms.centrality.current_flow_betweenness.current_flow_betweenness_centrality:
  - 256
  - 257
  - 261
  - 174
  - 244
  - 246
  - 247
  - 250
  - 251
  - 252
  - 253
  - 254
  - 255
  networkx.algorithms.centrality.current_flow_betweenness.edge_current_flow_betweenness_centrality:
  - 352
  - 353
  - 354
  - 358
  - 359
  - 360
  - 361
  - 362
  - 364
  - 269
  - 345
  - 347
  - 348
  - 351
  networkx.algorithms.centrality.current_flow_betweenness_subset:
  - 1
  - 13
  - 14
  - 123
  - 124
  networkx.algorithms.centrality.current_flow_betweenness_subset.current_flow_betweenness_centrality_subset:
  - 98
  - 100
  - 101
  - 104
  - 105
  - 106
  - 107
  - 108
  - 110
  - 112
  - 113
  - 18
  - 114
  - 118
  - 120
  networkx.algorithms.centrality.current_flow_betweenness_subset.edge_current_flow_betweenness_centrality_subset:
  - 128
  - 225
  - 227
  - 206
  - 208
  - 209
  - 212
  - 213
  - 214
  - 215
  - 216
  - 220
  - 221
  - 223
  networkx.algorithms.centrality.current_flow_closeness:
  - 1
  - 14
  - 15
  networkx.algorithms.centrality.current_flow_closeness.current_flow_closeness_centrality:
  - 71
  - 78
  - 79
  - 17
  - 82
  - 83
  - 84
  - 85
  - 86
  - 87
  - 88
  - 89
  - 90
  - 91
  - 92
  - 93
  networkx.algorithms.centrality.degree_alg:
  - 1
  - 53
  - 103
  networkx.algorithms.centrality.degree_alg.degree_centrality:
  - 48
  - 49
  - 11
  - 45
  networkx.algorithms.centrality.degree_alg.in_degree_centrality:
  - 56
  - 98
  - 99
  - 95
  networkx.algorithms.centrality.degree_alg.out_degree_centrality:
  - 145
  - 106
  - 148
  - 149
  networkx.algorithms.centrality.dispersion.dispersion:
  - 96
  - 99
  - 100
  - 101
  - 102
  - 105
  - 10
  - 85
  - 87
  - 89
  - 90
  - 91
  - 94
  - 95
  networkx.algorithms.centrality.dispersion.dispersion._dispersion:
  - 65
  - 67
  - 69
  - 71
  - 75
  - 78
  - 80
  - 58
  - 59
  - 63
  networkx.algorithms.centrality.eigenvector:
  - 1
  - 11
  - 12
  - 197
  networkx.algorithms.centrality.eigenvector.eigenvector_centrality:
  - 192
  - 162
  - 167
  - 169
  - 173
  - 14
  - 174
  - 175
  - 177
  - 179
  - 181
  - 182
  - 183
  - 189
  - 190
  networkx.algorithms.centrality.eigenvector.eigenvector_centrality_numpy:
  - 352
  - 355
  - 356
  - 357
  - 199
  - 342
  - 346
  - 347
  - 351
  networkx.algorithms.centrality.flow_matrix:
  - 6
  networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian.init_solver:
  - 120
  - 118
  networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian.solve:
  - 123
  - 124
  networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian.solve_inverse:
  - 128
  - 130
  networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.init_solver:
  - 84
  - 85
  networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian.solve:
  - 88
  networkx.algorithms.centrality.flow_matrix.InverseLaplacian.__init__:
  - 48
  - 50
  - 44
  - 45
  networkx.algorithms.centrality.flow_matrix.InverseLaplacian.get_row:
  - 67
  networkx.algorithms.centrality.flow_matrix.InverseLaplacian.get_rows:
  - 62
  - 63
  networkx.algorithms.centrality.flow_matrix.InverseLaplacian.width:
  - 72
  - 74
  - 75
  - 77
  - 78
  networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.init_solver:
  - 100
  networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.solve:
  - 108
  - 109
  networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian.solve_inverse:
  - 105
  - 103
  networkx.algorithms.centrality.flow_matrix.flow_matrix_row:
  - 16
  - 17
  - 18
  - 19
  - 22
  - 23
  - 24
  - 29
  - 30
  networkx.algorithms.centrality.group:
  - 1
  - 548
  - 743
  - 240
  - 23
  - 696
  networkx.algorithms.centrality.group._dfbnb:
  - 418
  - 451
  - 454
  - 423
  - 424
  - 425
  - 431
  - 435
  - 436
  - 440
  - 444
  - 447
  networkx.algorithms.centrality.group._group_preprocessing:
  - 224
  - 226
  - 227
  - 205
  - 206
  - 207
  - 208
  - 210
  - 211
  - 212
  - 213
  - 215
  - 218
  - 219
  - 220
  - 221
  - 222
  networkx.algorithms.centrality.group._heuristic:
  - 517
  - 518
  - 522
  - 523
  - 526
  - 533
  - 534
  - 535
  - 536
  - 538
  - 465
  - 466
  - 470
  - 471
  - 474
  - 475
  - 479
  - 484
  - 490
  - 496
  - 506
  - 510
  networkx.algorithms.centrality.group.group_betweenness_centrality:
  - 128
  - 131
  - 132
  - 135
  - 136
  - 137
  - 138
  - 139
  - 141
  - 142
  - 146
  - 149
  - 151
  - 153
  - 25
  - 157
  - 159
  - 165
  - 166
  - 171
  - 172
  - 174
  - 176
  - 177
  - 178
  - 179
  - 180
  - 187
  - 192
  - 195
  - 196
  - 120
  - 124
  networkx.algorithms.centrality.group.group_closeness_centrality:
  - 550
  - 625
  - 626
  - 628
  - 629
  - 631
  - 633
  - 639
  networkx.algorithms.centrality.group.group_degree_centrality:
  - 691
  - 692
  - 647
  networkx.algorithms.centrality.group.group_in_degree_centrality:
  - 699
  - 740
  networkx.algorithms.centrality.group.group_out_degree_centrality:
  - 746
  - 787
  networkx.algorithms.centrality.group.prominent_group:
  - 384
  - 389
  - 390
  - 392
  - 394
  - 395
  - 396
  - 397
  - 398
  - 405
  - 410
  - 412
  - 346
  - 347
  - 348
  - 350
  - 352
  - 353
  - 355
  - 356
  - 357
  - 358
  - 360
  - 361
  - 362
  - 365
  - 244
  - 372
  - 377
  - 379
  - 383
  networkx.algorithms.centrality.harmonic:
  - 1
  - 10
  networkx.algorithms.centrality.harmonic.harmonic_centrality:
  - 68
  - 69
  - 74
  - 12
  - 77
  - 78
  - 80
  - 81
  - 82
  - 83
  - 85
  networkx.algorithms.centrality.katz:
  - 1
  - 197
  - 198
  - 11
  - 12
  networkx.algorithms.centrality.katz.katz_centrality:
  - 161
  - 164
  - 186
  - 170
  - 172
  - 174
  - 175
  - 176
  - 177
  - 149
  - 181
  - 23
  - 152
  - 182
  - 154
  - 183
  - 191
  networkx.algorithms.centrality.katz.katz_centrality_numpy:
  - 321
  - 325
  - 327
  - 200
  - 330
  - 331
  - 311
  - 314
  - 315
  - 317
  - 319
  networkx.algorithms.centrality.laplacian:
  - 1
  - 10
  networkx.algorithms.centrality.laplacian.laplacian_centrality:
  - 129
  - 131
  - 132
  - 136
  - 137
  - 139
  - 140
  - 14
  - 145
  - 148
  - 105
  - 107
  - 108
  - 112
  - 113
  - 114
  - 118
  - 120
  - 121
  - 123
  - 125
  networkx.algorithms.centrality.load:
  - 1
  - 10
  networkx.algorithms.centrality.load._edge_betweenness:
  - 192
  - 193
  - 194
  - 196
  - 197
  - 177
  - 179
  - 181
  - 184
  - 189
  - 190
  networkx.algorithms.centrality.load._node_betweenness:
  - 128
  - 129
  - 132
  - 102
  - 103
  - 105
  - 108
  - 109
  - 124
  - 113
  - 116
  - 117
  - 118
  - 87
  - 119
  - 120
  - 127
  networkx.algorithms.centrality.load.edge_load_centrality:
  - 165
  - 169
  - 170
  - 171
  - 142
  networkx.algorithms.centrality.load.newman_betweenness_centrality:
  - 65
  - 66
  - 67
  - 71
  - 72
  - 73
  - 74
  - 12
  - 76
  - 77
  - 78
  - 81
  - 60
  - 62
  - 63
  networkx.algorithms.centrality.percolation:
  - 1
  - 14
  networkx.algorithms.centrality.percolation._accumulate_percolation:
  - 120
  - 122
  - 124
  - 118
  networkx.algorithms.centrality.percolation.percolation_centrality:
  - 98
  - 100
  - 101
  - 103
  - 105
  - 109
  - 111
  - 16
  - 86
  - 90
  - 91
  - 95
  networkx.algorithms.centrality.reaching:
  - 1
  - 34
  - 121
  networkx.algorithms.centrality.reaching._average_weight:
  - 10
  - 25
  - 26
  - 28
  - 30
  networkx.algorithms.centrality.reaching.global_reaching_centrality:
  - 36
  - 101
  - 106
  - 108
  - 113
  - 114
  - 117
  - 118
  - 87
  - 89
  - 90
  networkx.algorithms.centrality.reaching.global_reaching_centrality.as_distance:
  - 104
  networkx.algorithms.centrality.reaching.local_reaching_centrality:
  - 195
  - 197
  - 200
  - 201
  - 202
  - 203
  - 207
  - 208
  - 209
  - 181
  - 185
  - 186
  - 123
  - 188
  - 190
  networkx.algorithms.centrality.reaching.local_reaching_centrality.as_distance:
  - 193
  networkx.algorithms.centrality.second_order:
  - 1
  - 42
  - 41
  networkx.algorithms.centrality.second_order.second_order_centrality:
  - 129
  - 131
  - 132
  - 133
  - 136
  - 137
  - 139
  - 44
  - 104
  - 106
  - 108
  - 110
  - 114
  - 115
  - 116
  - 117
  - 118
  - 119
  - 121
  - 122
  networkx.algorithms.centrality.second_order.second_order_centrality._Qj:
  - 125
  networkx.algorithms.centrality.subgraph_alg:
  - 1
  - 111
  - 16
  - 112
  - 17
  - 212
  - 213
  networkx.algorithms.centrality.subgraph_alg.communicability_betweenness_centrality:
  - 288
  - 289
  - 291
  - 294
  - 295
  - 298
  - 302
  - 303
  - 308
  - 309
  - 311
  - 216
  - 283
  - 284
  - 285
  - 287
  networkx.algorithms.centrality.subgraph_alg.estrada_index:
  - 361
  - 317
  networkx.algorithms.centrality.subgraph_alg.subgraph_centrality:
  - 196
  - 197
  - 199
  - 200
  - 201
  - 202
  - 203
  - 205
  - 208
  - 115
  networkx.algorithms.centrality.subgraph_alg.subgraph_centrality_exp:
  - 98
  - 99
  - 102
  - 103
  - 104
  - 105
  - 107
  - 20
  networkx.algorithms.centrality.trophic:
  - 1
  - 103
  - 104
  - 9
  - 10
  - 138
  - 139
  networkx.algorithms.centrality.trophic.trophic_differences:
  - 106
  - 131
  - 133
  networkx.algorithms.centrality.trophic.trophic_incoherence_parameter:
  - 168
  - 169
  - 172
  - 141
  - 173
  - 175
  - 176
  - 180
  - 181
  networkx.algorithms.centrality.trophic.trophic_levels:
  - 65
  - 97
  - 98
  - 68
  - 75
  - 12
  - 77
  - 46
  - 53
  - 86
  - 56
  - 92
  networkx.algorithms.centrality.voterank_alg:
  - 1
  networkx.algorithms.centrality.voterank_alg.voterank:
  - 64
  - 67
  - 69
  - 72
  - 10
  - 74
  - 77
  - 92
  - 80
  - 82
  - 85
  - 86
  - 88
  - 94
  - 58
  - 60
  - 61
  - 62
  networkx.algorithms.chains:
  - 1
  - 10
  - 9
  networkx.algorithms.chains.chain_decomposition:
  - 163
  - 164
  - 165
  - 167
  - 168
  - 171
  - 172
  - 13
  - 146
  - 152
  networkx.algorithms.chains.chain_decomposition._build_chain:
  - 140
  - 124
  - 141
  - 143
  networkx.algorithms.chains.chain_decomposition._dfs_cycle_forest:
  - 98
  - 100
  - 68
  - 101
  - 105
  - 106
  - 107
  - 109
  - 110
  - 111
  - 115
  - 116
  networkx.algorithms.chordal:
  - 1
  - 372
  - 373
  - 30
  - 31
  networkx.algorithms.chordal.NetworkXTreewidthBoundExceeded:
  - 26
  networkx.algorithms.chordal._find_chordality_breaker:
  - 352
  - 353
  - 354
  - 355
  - 356
  - 357
  - 359
  - 360
  - 334
  - 367
  - 343
  - 345
  - 346
  - 347
  - 348
  networkx.algorithms.chordal._find_missing_edge:
  - 312
  - 313
  - 314
  - 315
  - 316
  - 317
  networkx.algorithms.chordal._is_complete_graph:
  - 300
  - 301
  - 303
  - 304
  - 306
  networkx.algorithms.chordal._max_cardinality_node:
  - 321
  - 325
  - 326
  - 327
  networkx.algorithms.chordal.chordal_graph_cliques:
  - 224
  - 225
  - 226
  - 230
  - 231
  - 232
  - 233
  - 234
  - 235
  - 236
  - 237
  - 174
  - 238
  - 242
  - 218
  - 219
  - 220
  - 222
  networkx.algorithms.chordal.chordal_graph_treewidth:
  - 290
  - 295
  - 294
  - 247
  networkx.algorithms.chordal.complete_to_chordal_graph:
  - 416
  - 418
  - 419
  - 420
  - 421
  - 423
  - 424
  - 427
  - 428
  - 429
  - 436
  - 437
  - 438
  - 375
  - 440
  - 442
  - 414
  networkx.algorithms.chordal.find_induced_nodes:
  - 160
  - 161
  - 162
  - 164
  - 165
  - 166
  - 167
  - 148
  - 151
  - 152
  - 153
  - 154
  - 158
  - 157
  - 94
  - 159
  networkx.algorithms.chordal.is_chordal:
  - 89
  - 34
  - 87
  networkx.algorithms.clique:
  - 1
  - 101
  - 423
  - 765
  - 300
  - 471
  - 29
  - 766
  networkx.algorithms.clique.MaxWeightClique:
  - 664
  networkx.algorithms.clique.MaxWeightClique.__init__:
  - 704
  - 694
  - 695
  - 697
  - 698
  - 701
  networkx.algorithms.clique.MaxWeightClique.expand:
  - 743
  - 747
  - 748
  - 750
  - 751
  - 754
  - 755
  networkx.algorithms.clique.MaxWeightClique.find_branching_nodes:
  - 737
  - 727
  - 732
  - 733
  - 735
  networkx.algorithms.clique.MaxWeightClique.find_max_weight_clique:
  - 760
  - 762
  - 758
  networkx.algorithms.clique.MaxWeightClique.find_max_weight_clique.<lambda1>:
  - 760
  networkx.algorithms.clique.MaxWeightClique.greedily_find_independent_set:
  - 722
  - 723
  - 716
  networkx.algorithms.clique.MaxWeightClique.update_incumbent_if_improved:
  - 707
  - 711
  networkx.algorithms.clique.enumerate_all_cliques:
  - 32
  - 96
  - 78
  - 79
  - 83
  - 89
  - 90
  - 91
  - 93
  - 95
  networkx.algorithms.clique.find_cliques:
  - 257
  - 258
  - 259
  - 263
  - 264
  - 267
  - 269
  - 271
  - 276
  - 277
  - 278
  - 282
  - 283
  - 286
  - 287
  - 288
  - 291
  - 294
  - 295
  - 104
  - 250
  networkx.algorithms.clique.find_cliques.<lambda1>:
  - 271
  networkx.algorithms.clique.find_cliques.<lambda2>:
  - 291
  networkx.algorithms.clique.find_cliques_recursive:
  - 387
  - 388
  - 420
  - 394
  - 395
  - 396
  - 303
  - 400
  - 401
  - 403
  networkx.algorithms.clique.find_cliques_recursive.expand:
  - 416
  - 417
  - 418
  - 406
  - 407
  - 408
  - 409
  - 412
  - 413
  networkx.algorithms.clique.find_cliques_recursive.expand.<lambda1>:
  - 406
  networkx.algorithms.clique.make_clique_bipartite:
  - 515
  - 516
  - 473
  - 506
  - 507
  - 510
  - 511
  networkx.algorithms.clique.make_max_clique_graph:
  - 425
  - 458
  - 459
  - 461
  - 462
  - 464
  - 466
  - 467
  networkx.algorithms.clique.max_weight_clique:
  - 768
  - 817
  - 816
  networkx.algorithms.clique.node_clique_number:
  - 576
  - 577
  - 578
  - 580
  - 522
  - 555
  - 554
  - 558
  - 559
  - 562
  - 566
  - 569
  - 570
  - 574
  - 575
  networkx.algorithms.clique.number_of_cliques:
  - 647
  - 648
  - 586
  - 651
  - 650
  - 653
  - 656
  - 658
  networkx.algorithms.cluster:
  - 160
  - 1
  - 98
  - 194
  - 258
  - 324
  - 384
  - 20
  - 119
  - 669
  networkx.algorithms.cluster._directed_triangles_and_degree_iter:
  - 162
  - 170
  - 172
  - 173
  - 174
  - 177
  - 178
  - 179
  - 180
  - 182
  - 189
  - 190
  - 191
  networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter:
  - 196
  - 206
  - 209
  - 211
  - 216
  - 217
  - 218
  - 221
  - 222
  - 223
  - 224
  - 225
  - 227
  - 228
  - 230
  - 231
  - 233
  - 234
  - 237
  - 238
  - 239
  - 240
  - 241
  - 243
  - 244
  - 246
  - 247
  - 249
  - 250
  - 253
  - 254
  - 255
  networkx.algorithms.cluster._directed_weighted_triangles_and_degree_iter.wt:
  - 214
  networkx.algorithms.cluster._triangles_and_degree_iter:
  - 100
  - 107
  - 108
  - 110
  - 112
  - 113
  - 114
  - 115
  - 116
  networkx.algorithms.cluster._weighted_triangles_and_degree_iter:
  - 153
  - 131
  - 134
  - 135
  - 136
  - 138
  - 143
  - 144
  - 146
  - 147
  - 148
  - 150
  - 121
  - 154
  - 155
  - 157
  networkx.algorithms.cluster._weighted_triangles_and_degree_iter.wt:
  - 141
  networkx.algorithms.cluster.all_triangles:
  - 320
  - 321
  - 261
  - 300
  - 303
  - 304
  - 306
  - 309
  - 311
  - 313
  - 314
  - 315
  - 316
  - 318
  - 319
  networkx.algorithms.cluster.average_clustering:
  - 326
  - 378
  - 379
  - 380
  - 381
  networkx.algorithms.cluster.clustering:
  - 480
  - 386
  - 487
  - 488
  - 491
  - 493
  - 472
  - 473
  - 474
  networkx.algorithms.cluster.generalized_degree:
  - 672
  - 730
  - 731
  - 732
  networkx.algorithms.cluster.square_clustering:
  - 544
  - 640
  - 614
  - 616
  - 663
  - 618
  - 619
  - 650
  - 652
  - 653
  - 654
  - 659
  - 629
  - 599
  - 602
  - 636
  - 638
  networkx.algorithms.cluster.square_clustering.GAdj:
  - 607
  networkx.algorithms.cluster.square_clustering.GAdj.__missing__:
  - 610
  - 611
  networkx.algorithms.cluster.transitivity:
  - 536
  - 533
  - 538
  - 501
  networkx.algorithms.cluster.triangles:
  - 65
  - 67
  - 68
  - 72
  - 81
  - 86
  - 23
  - 87
  - 90
  - 88
  - 93
  - 95
  networkx.algorithms.coloring.equitable_coloring:
  - 1
  - 115
  networkx.algorithms.coloring.equitable_coloring.change_color:
  - 96
  - 100
  - 101
  - 75
  - 81
  - 83
  - 87
  - 92
  networkx.algorithms.coloring.equitable_coloring.equitable_color:
  - 391
  - 435
  - 439
  - 442
  - 443
  - 447
  - 454
  - 461
  - 463
  - 466
  - 469
  - 472
  - 474
  - 475
  - 477
  - 480
  - 482
  - 483
  - 488
  - 490
  - 493
  - 496
  - 498
  - 500
  - 503
  networkx.algorithms.coloring.equitable_coloring.is_coloring:
  - 16
  - 14
  networkx.algorithms.coloring.equitable_coloring.is_equitable:
  - 32
  - 33
  - 38
  - 39
  - 41
  - 43
  - 44
  - 45
  - 21
  - 23
  - 27
  - 28
  - 31
  networkx.algorithms.coloring.equitable_coloring.make_C_from_F:
  - 51
  - 52
  - 53
  networkx.algorithms.coloring.equitable_coloring.make_H_from_C_N:
  - 70
  networkx.algorithms.coloring.equitable_coloring.make_N_from_L_C:
  - 59
  - 60
  - 62
  networkx.algorithms.coloring.equitable_coloring.move_witnesses:
  - 105
  - 110
  - 111
  networkx.algorithms.coloring.equitable_coloring.pad_graph:
  - 130
  - 135
  - 136
  - 117
  - 125
  networkx.algorithms.coloring.equitable_coloring.procedure_P:
  - 385
  - 259
  - 264
  - 142
  - 144
  - 145
  - 273
  - 147
  - 278
  - 153
  - 282
  - 156
  - 284
  - 160
  - 161
  - 288
  - 167
  - 168
  - 298
  - 301
  - 174
  - 302
  - 176
  - 305
  - 306
  - 180
  - 181
  - 184
  - 312
  - 186
  - 313
  - 316
  - 189
  - 317
  - 318
  - 320
  - 321
  - 322
  - 196
  - 197
  - 201
  - 202
  - 205
  - 206
  - 334
  - 210
  - 339
  - 213
  - 215
  - 221
  - 351
  - 354
  - 357
  - 232
  - 360
  - 363
  - 236
  - 248
  - 377
  - 251
  networkx.algorithms.coloring.greedy_coloring:
  - 1
  - 34
  networkx.algorithms.coloring.greedy_coloring._Node.__init__:
  - 386
  networkx.algorithms.coloring.greedy_coloring._Node.assign_color:
  - 398
  networkx.algorithms.coloring.greedy_coloring._Node.clear_color:
  - 402
  - 406
  networkx.algorithms.coloring.greedy_coloring._Node.iter_neighbors:
  - 412
  networkx.algorithms.coloring.greedy_coloring._Node.iter_neighbors_color:
  - 418
  networkx.algorithms.coloring.greedy_coloring._greedy_coloring_with_interchange:
  - 512
  - 516
  - 518
  - 519
  - 520
  - 521
  - 525
  - 526
  - 532
  - 534
  - 545
  - 548
  - 549
  - 552
  - 553
  - 558
  - 561
  - 563
  - 565
  - 443
  - 471
  - 473
  - 475
  - 476
  - 477
  - 488
  - 490
  - 492
  - 493
  - 496
  - 498
  - 503
  - 504
  - 509
  - 510
  networkx.algorithms.coloring.greedy_coloring._maximal_independent_set:
  - 107
  - 112
  - 113
  - 115
  - 116
  - 117
  - 118
  networkx.algorithms.coloring.greedy_coloring.greedy_color:
  - 355
  - 356
  - 359
  - 267
  - 363
  - 364
  - 365
  - 366
  - 370
  - 371
  - 345
  - 348
  - 349
  networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential:
  - 195
  - 196
  - 199
  - 200
  - 201
  - 173
  - 186
  - 188
  networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential_bfs:
  - 147
  - 156
  networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential_dfs:
  - 160
  - 169
  networkx.algorithms.coloring.greedy_coloring.strategy_independent_set:
  - 139
  - 140
  - 141
  - 143
  - 123
  networkx.algorithms.coloring.greedy_coloring.strategy_largest_first:
  - 25
  - 31
  networkx.algorithms.coloring.greedy_coloring.strategy_random_sequential:
  - 36
  - 45
  - 44
  networkx.algorithms.coloring.greedy_coloring.strategy_saturation_largest_first:
  - 205
  - 212
  - 216
  - 217
  - 218
  - 222
  - 223
  - 224
  - 228
  - 229
  - 230
  - 233
  - 234
  - 236
  - 238
  - 239
  - 240
  - 244
  - 247
  - 248
  networkx.algorithms.coloring.greedy_coloring.strategy_saturation_largest_first.<lambda1>:
  - 247
  networkx.algorithms.coloring.greedy_coloring.strategy_smallest_last:
  - 50
  - 68
  - 69
  - 72
  - 73
  - 74
  - 75
  - 76
  - 83
  - 85
  - 86
  - 87
  - 89
  - 92
  - 93
  - 94
  - 95
  - 97
  - 100
  networkx.algorithms.coloring.greedy_coloring.strategy_smallest_last.find_min_degree:
  - 81
  networkx.algorithms.communicability_alg:
  - 1
  - 11
  - 12
  - 93
  - 94
  networkx.algorithms.communicability_alg.communicability:
  - 72
  - 73
  - 76
  - 77
  - 78
  - 15
  - 81
  - 83
  - 87
  - 89
  networkx.algorithms.communicability_alg.communicability_exp:
  - 97
  - 161
  - 162
  - 151
  - 152
  - 156
  - 157
  - 159
  networkx.algorithms.community:
  - 1
  networkx.algorithms.community.asyn_fluid:
  - 1
  - 13
  - 14
  - 15
  networkx.algorithms.community.asyn_fluid.asyn_fluidc:
  - 132
  - 136
  - 18
  - 153
  - 71
  - 73
  - 75
  - 77
  - 79
  - 84
  - 85
  - 86
  - 89
  - 99
  - 100
  - 101
  - 103
  - 106
  - 110
  - 112
  - 117
  - 118
  - 121
  - 126
  networkx.algorithms.community.centrality:
  - 8
  - 1
  networkx.algorithms.community.centrality._without_most_central_edges:
  - 164
  - 167
  - 168
  - 169
  - 170
  - 152
  networkx.algorithms.community.centrality.girvan_newman:
  - 130
  - 10
  - 143
  - 146
  - 147
  - 148
  - 125
  - 126
  networkx.algorithms.community.centrality.girvan_newman.most_valuable_edge:
  - 139
  - 140
  - 133
  networkx.algorithms.community.community_utils:
  - 1
  networkx.algorithms.community.community_utils.is_partition:
  - 27
  - 10
  - 26
  - 30
  networkx.algorithms.community.divisive:
  - 107
  - 11
  networkx.algorithms.community.divisive.edge_betweenness_partition:
  - 97
  - 98
  - 99
  - 100
  - 101
  - 102
  - 103
  - 13
  - 88
  - 90
  - 91
  - 92
  - 94
  networkx.algorithms.community.divisive.edge_current_flow_betweenness_partition:
  - 164
  - 166
  - 167
  - 168
  - 170
  - 173
  - 178
  - 179
  - 180
  - 181
  - 186
  - 187
  - 189
  - 190
  - 191
  - 192
  - 193
  - 195
  - 196
  - 198
  - 199
  - 201
  - 202
  - 205
  - 206
  - 209
  - 210
  - 212
  - 213
  - 109
  networkx.algorithms.community.kclique._get_adjacent_cliques:
  - 74
  - 75
  - 76
  - 77
  - 78
  networkx.algorithms.community.kclique.k_clique_communities:
  - 64
  - 65
  - 69
  - 70
  - 10
  - 47
  - 49
  - 50
  - 51
  - 54
  - 55
  - 56
  - 57
  - 60
  - 61
  - 62
  - 63
  networkx.algorithms.community.kernighan_lin:
  - 1
  - 43
  - 44
  - 45
  networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep:
  - 34
  - 35
  - 36
  - 37
  - 40
  - 13
  - 18
  - 19
  - 20
  - 21
  networkx.algorithms.community.kernighan_lin._kernighan_lin_sweep._update_costs:
  - 24
  - 26
  - 27
  - 29
  networkx.algorithms.community.kernighan_lin.kernighan_lin_bisection:
  - 128
  - 129
  - 130
  - 133
  - 137
  - 138
  - 47
  - 96
  - 97
  - 98
  - 99
  - 101
  - 108
  - 111
  - 114
  - 117
  - 118
  - 124
  - 127
  networkx.algorithms.community.label_propagation:
  - 1
  - 140
  - 141
  - 236
  - 17
  - 18
  networkx.algorithms.community.label_propagation._color_network:
  - 288
  - 289
  - 290
  - 291
  - 283
  networkx.algorithms.community.label_propagation._fast_label_count:
  - 128
  - 129
  - 133
  - 134
  - 106
  - 111
  - 113
  - 114
  - 118
  - 119
  - 120
  - 122
  - 123
  - 124
  networkx.algorithms.community.label_propagation._labeling_complete:
  - 305
  - 298
  - 306
  networkx.algorithms.community.label_propagation._most_frequent_labels:
  - 321
  - 322
  - 323
  - 311
  - 315
  networkx.algorithms.community.label_propagation._update_label:
  - 327
  - 332
  - 333
  - 334
  - 335
  - 337
  - 338
  networkx.algorithms.community.label_propagation.asyn_lpa_communities:
  - 192
  - 197
  - 198
  - 229
  - 200
  - 201
  - 230
  - 233
  - 143
  - 208
  - 211
  - 215
  - 216
  - 220
  - 222
  networkx.algorithms.community.label_propagation.fast_label_propagation_communities:
  - 97
  - 98
  - 99
  - 68
  - 69
  - 100
  - 102
  - 72
  - 75
  - 79
  - 80
  - 83
  - 20
  - 85
  - 86
  - 89
  - 93
  networkx.algorithms.community.label_propagation.label_propagation_communities:
  - 267
  - 269
  - 270
  - 239
  - 272
  - 273
  - 274
  - 276
  - 277
  - 278
  - 279
  networkx.algorithms.community.leiden:
  - 1
  - 110
  - 111
  - 112
  - 18
  - 19
  - 20
  networkx.algorithms.community.leiden.leiden_communities:
  - 101
  - 102
  - 103
  - 105
  - 106
  - 107
  - 22
  networkx.algorithms.community.leiden.leiden_partitions:
  - 114
  networkx.algorithms.community.local:
  - 1
  networkx.algorithms.community.local._calculate_local_modularity_for_candidate:
  - 128
  - 129
  - 131
  - 69
  - 99
  - 100
  - 101
  - 102
  - 105
  - 106
  - 108
  - 110
  - 112
  - 115
  - 116
  - 117
  - 118
  - 120
  - 122
  - 125
  - 126
  - 127
  networkx.algorithms.community.local._clauset_greedy_source_expansion:
  - 32
  - 33
  - 36
  - 37
  - 42
  - 44
  - 45
  - 48
  - 56
  - 57
  - 27
  - 28
  - 61
  - 31
  networkx.algorithms.community.local.greedy_source_expansion:
  - 220
  - 141
  networkx.algorithms.community.louvain:
  - 1
  - 133
  - 134
  - 14
  - 15
  networkx.algorithms.community.louvain._convert_multigraph:
  - 373
  - 374
  - 375
  - 377
  - 378
  - 379
  - 380
  - 383
  networkx.algorithms.community.louvain._gen_graph:
  - 353
  - 354
  - 356
  - 357
  - 358
  - 360
  - 361
  - 363
  - 367
  - 368
  networkx.algorithms.community.louvain._neighbor_weights:
  - 336
  - 346
  - 347
  networkx.algorithms.community.louvain._one_level:
  - 256
  - 257
  - 258
  - 259
  - 261
  - 262
  - 265
  - 266
  - 267
  - 268
  - 269
  - 274
  - 277
  - 278
  - 295
  - 296
  - 313
  - 316
  - 321
  - 322
  - 323
  - 324
  - 325
  - 326
  - 330
  - 331
  - 228
  - 247
  - 248
  - 249
  - 250
  - 251
  - 252
  - 253
  networkx.algorithms.community.louvain.louvain_communities:
  - 128
  - 129
  - 130
  - 19
  - 124
  - 125
  - 126
  networkx.algorithms.community.louvain.louvain_partitions:
  - 194
  - 195
  - 196
  - 198
  - 199
  - 200
  - 201
  - 138
  - 203
  - 204
  - 205
  - 207
  - 208
  - 214
  - 215
  - 218
  - 221
  - 222
  networkx.algorithms.community.lukes:
  - 1
  - 28
  networkx.algorithms.community.lukes._split_n_from:
  - 24
  - 25
  networkx.algorithms.community.lukes.lukes_partitioning:
  - 132
  - 140
  - 30
  - 167
  - 168
  - 174
  - 178
  - 182
  - 187
  - 188
  - 189
  - 190
  - 191
  - 200
  - 202
  - 75
  - 78
  - 79
  - 80
  - 207
  - 82
  - 84
  - 86
  - 215
  - 217
  - 90
  - 91
  - 92
  - 93
  - 222
  - 95
  - 96
  - 224
  - 105
  - 106
  - 107
  - 118
  - 125
  networkx.algorithms.community.lukes.lukes_partitioning._a_parent_of_leaves_only:
  - 128
  - 129
  - 127
  networkx.algorithms.community.lukes.lukes_partitioning._concatenate_or_merge:
  - 161
  - 164
  - 150
  - 151
  - 152
  - 156
  - 157
  - 158
  networkx.algorithms.community.lukes.lukes_partitioning._leaves:
  - 121
  - 122
  - 123
  networkx.algorithms.community.lukes.lukes_partitioning._pivot:
  - 146
  networkx.algorithms.community.lukes.lukes_partitioning._value_of_cluster:
  - 135
  networkx.algorithms.community.lukes.lukes_partitioning._value_of_partition:
  - 138
  networkx.algorithms.community.lukes.lukes_partitioning._weight_of_cluster:
  - 142
  networkx.algorithms.community.modularity_max:
  - 1
  - 226
  - 357
  - 358
  - 359
  networkx.algorithms.community.modularity_max._greedy_modularity_communities_generator:
  - 128
  - 131
  - 132
  - 134
  - 136
  - 137
  - 140
  - 143
  - 17
  - 147
  - 148
  - 152
  - 154
  - 156
  - 161
  - 166
  - 174
  - 176
  - 179
  - 181
  - 183
  - 187
  - 188
  - 191
  - 196
  - 198
  - 73
  - 74
  - 202
  - 204
  - 77
  - 205
  - 207
  - 208
  - 83
  - 84
  - 85
  - 211
  - 87
  - 215
  - 91
  - 92
  - 93
  - 219
  - 223
  - 99
  - 100
  - 105
  - 107
  - 110
  - 111
  - 114
  - 119
  - 123
  - 125
  - 127
  networkx.algorithms.community.modularity_max._greedy_modularity_communities_generator.<lambda1>:
  - 91
  networkx.algorithms.community.modularity_max.greedy_modularity_communities:
  - 312
  - 315
  - 317
  - 318
  - 320
  - 322
  - 323
  - 325
  - 328
  - 333
  - 336
  - 338
  - 341
  - 343
  - 346
  - 350
  - 352
  - 354
  - 234
  networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities:
  - 417
  - 449
  - 419
  - 420
  - 451
  - 422
  - 361
  - 426
  - 427
  - 430
  - 432
  - 436
  - 407
  - 443
  - 412
  - 445
  networkx.algorithms.community.quality:
  - 144
  - 1
  - 58
  networkx.algorithms.community.quality.NotAPartition:
  - 17
  networkx.algorithms.community.quality.NotAPartition.__init__:
  - 21
  networkx.algorithms.community.quality._require_partition:
  - 25
  - 53
  networkx.algorithms.community.quality.inter_community_edges:
  - 81
  - 107
  - 108
  networkx.algorithms.community.quality.inter_community_non_edges:
  - 113
  - 141
  networkx.algorithms.community.quality.intra_community_edges:
  - 76
  - 63
  networkx.algorithms.community.quality.modularity:
  - 229
  - 230
  - 231
  - 234
  - 235
  - 236
  - 237
  - 238
  - 241
  - 146
  - 242
  - 255
  networkx.algorithms.community.quality.modularity.community_contribution:
  - 248
  - 250
  - 251
  - 247
  networkx.algorithms.community.quality.partition_quality:
  - 261
  - 325
  - 327
  - 334
  - 335
  - 307
  - 308
  - 340
  - 342
  - 312
  - 314
  - 315
  - 318
  networkx.algorithms.components.attracting:
  - 1
  - 13
  - 86
  - 57
  networkx.algorithms.components.attracting.attracting_components:
  - 16
  - 50
  - 51
  - 52
  - 53
  - 54
  networkx.algorithms.components.attracting.is_attracting_component:
  - 112
  - 89
  - 114
  - 113
  networkx.algorithms.components.attracting.number_attracting_components:
  - 83
  - 60
  networkx.algorithms.components.biconnected:
  - 1
  - 97
  - 263
  - 170
  - 16
  - 338
  networkx.algorithms.components.biconnected._biconnected_dfs:
  - 384
  - 385
  - 387
  - 389
  - 391
  - 393
  - 394
  - 342
  - 343
  - 344
  - 349
  - 351
  - 356
  - 357
  - 359
  - 360
  - 361
  - 362
  - 363
  - 364
  - 366
  - 367
  - 368
  - 369
  - 370
  - 371
  - 374
  - 375
  - 376
  - 377
  - 379
  - 383
  networkx.algorithms.components.biconnected.articulation_points:
  - 266
  - 331
  - 332
  - 333
  - 334
  - 335
  networkx.algorithms.components.biconnected.biconnected_component_edges:
  - 100
  - 167
  networkx.algorithms.components.biconnected.biconnected_components:
  - 259
  - 260
  - 173
  networkx.algorithms.components.biconnected.is_biconnected:
  - 81
  - 83
  - 19
  - 88
  - 91
  networkx.algorithms.components.connected:
  - 1
  - 16
  - 211
  - 152
  - 93
  networkx.algorithms.components.connected._plain_bfs:
  - 268
  - 275
  - 276
  - 277
  - 278
  - 279
  - 280
  networkx.algorithms.components.connected.connected_components:
  - 19
  - 84
  - 85
  - 86
  - 87
  - 88
  - 89
  - 90
  networkx.algorithms.components.connected.is_connected:
  - 208
  - 155
  - 204
  - 203
  networkx.algorithms.components.connected.node_connected_component:
  - 264
  - 214
  networkx.algorithms.components.connected.number_connected_components:
  - 96
  - 149
  networkx.algorithms.components.semiconnected:
  - 1
  - 9
  networkx.algorithms.components.semiconnected.is_semiconnected:
  - 66
  - 69
  - 71
  - 12
  - 61
  networkx.algorithms.components.strongly_connected:
  - 1
  - 225
  - 15
  - 114
  - 277
  - 278
  - 184
  networkx.algorithms.components.strongly_connected.condensation:
  - 353
  - 354
  - 344
  - 355
  - 358
  - 340
  - 341
  - 280
  - 347
  - 349
  - 351
  networkx.algorithms.components.strongly_connected.is_strongly_connected:
  - 274
  - 228
  - 269
  networkx.algorithms.components.strongly_connected.kosaraju_strongly_connected_components:
  - 164
  - 165
  - 166
  - 167
  - 168
  - 169
  - 172
  - 174
  - 175
  - 176
  - 177
  - 178
  - 179
  - 180
  - 117
  - 181
  networkx.algorithms.components.strongly_connected.number_strongly_connected_components:
  - 187
  - 222
  networkx.algorithms.components.strongly_connected.strongly_connected_components:
  - 18
  - 76
  - 79
  - 80
  - 81
  - 85
  - 89
  - 90
  - 91
  - 94
  - 96
  - 97
  - 98
  - 99
  - 101
  - 102
  - 103
  - 106
  - 107
  - 108
  - 109
  - 111
  networkx.algorithms.components.weakly_connected:
  - 1
  - 110
  - 13
  - 70
  networkx.algorithms.components.weakly_connected._plain_bfs:
  - 192
  - 193
  - 194
  - 170
  - 185
  - 186
  - 187
  - 188
  - 189
  - 190
  - 191
  networkx.algorithms.components.weakly_connected.is_weakly_connected:
  - 160
  - 113
  - 161
  - 166
  networkx.algorithms.components.weakly_connected.number_weakly_connected_components:
  - 73
  - 107
  networkx.algorithms.components.weakly_connected.weakly_connected_components:
  - 64
  - 65
  - 66
  - 67
  - 16
  - 61
  - 62
  - 63
  networkx.algorithms.connectivity:
  - 1
  networkx.algorithms.connectivity.connectivity:
  - 1
  - 35
  - 487
  networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity:
  - 481
  - 421
  - 459
  - 462
  - 464
  - 465
  - 473
  - 475
  - 478
  - 479
  networkx.algorithms.connectivity.connectivity.average_node_connectivity:
  - 352
  - 399
  - 405
  - 406
  - 410
  - 411
  - 414
  networkx.algorithms.connectivity.connectivity.edge_connectivity:
  - 770
  - 771
  - 772
  - 774
  - 775
  - 648
  - 777
  - 780
  - 782
  - 786
  - 790
  - 792
  - 793
  - 797
  - 798
  - 799
  - 800
  - 807
  - 809
  - 747
  - 751
  - 752
  - 754
  - 756
  - 760
  - 761
  - 764
  - 766
  networkx.algorithms.connectivity.connectivity.local_edge_connectivity:
  - 640
  - 643
  - 491
  - 627
  - 630
  - 631
  - 637
  networkx.algorithms.connectivity.connectivity.local_node_connectivity:
  - 194
  - 195
  - 39
  - 200
  - 203
  - 206
  - 186
  - 189
  - 190
  networkx.algorithms.connectivity.connectivity.node_connectivity:
  - 323
  - 345
  - 329
  - 330
  - 300
  - 335
  - 304
  - 305
  - 337
  - 211
  - 307
  - 309
  - 339
  - 341
  - 312
  - 313
  - 342
  networkx.algorithms.connectivity.connectivity.node_connectivity.neighbors:
  - 320
  networkx.algorithms.connectivity.cuts:
  - 1
  - 162
  - 25
  networkx.algorithms.connectivity.cuts.minimum_edge_cut:
  - 551
  - 555
  - 556
  - 560
  - 561
  - 563
  - 565
  - 569
  - 571
  - 575
  - 576
  - 577
  - 578
  - 579
  - 581
  - 582
  - 457
  - 585
  - 586
  - 593
  - 597
  - 598
  - 601
  - 602
  - 603
  - 604
  - 611
  - 612
  - 613
  networkx.algorithms.connectivity.cuts.minimum_node_cut:
  - 403
  - 407
  - 408
  - 410
  - 412
  - 416
  - 417
  - 425
  - 431
  - 432
  - 436
  - 438
  - 311
  - 440
  - 441
  - 442
  - 445
  - 446
  - 448
  - 449
  networkx.algorithms.connectivity.cuts.minimum_node_cut.neighbors:
  - 422
  networkx.algorithms.connectivity.cuts.minimum_st_edge_cut:
  - 141
  - 144
  - 145
  - 151
  - 155
  - 156
  - 157
  - 31
  networkx.algorithms.connectivity.cuts.minimum_st_node_cut:
  - 289
  - 290
  - 294
  - 295
  - 168
  - 297
  - 298
  - 303
  networkx.algorithms.connectivity.disjoint_paths:
  - 1
  - 234
  - 23
  networkx.algorithms.connectivity.disjoint_paths._unique_everseen:
  - 402
  - 404
  - 406
  - 407
  - 408
  networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths:
  - 156
  - 30
  - 158
  - 161
  - 164
  - 165
  - 170
  - 171
  - 174
  - 177
  - 187
  - 189
  - 191
  - 193
  - 200
  - 206
  - 211
  - 212
  - 217
  - 218
  - 219
  - 223
  - 225
  - 229
  - 230
  networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths:
  - 361
  - 394
  - 363
  - 395
  - 397
  - 366
  - 367
  - 242
  - 371
  - 372
  - 376
  - 377
  - 380
  - 383
  networkx.algorithms.connectivity.edge_augmentation:
  - 1
  - 389
  - 390
  - 135
  - 136
  - 1159
  - 1160
  - 1161
  - 77
  - 78
  - 530
  - 1044
  - 26
  - 27
  - 444
  - 445
  networkx.algorithms.connectivity.edge_augmentation._compat_shuffle:
  - 1155
  - 1156
  networkx.algorithms.connectivity.edge_augmentation._lightest_meta_edges:
  - 576
  - 578
  - 579
  - 567
  - 566
  - 534
  - 569
  - 571
  - 574
  networkx.algorithms.connectivity.edge_augmentation._minimum_rooted_branching:
  - 1040
  - 1036
  - 1021
  - 1038
  networkx.algorithms.connectivity.edge_augmentation._ordered:
  - 500
  networkx.algorithms.connectivity.edge_augmentation._unpack_available_edges:
  - 520
  - 522
  - 524
  - 525
  - 526
  - 505
  - 506
  - 508
  - 509
  - 510
  networkx.algorithms.connectivity.edge_augmentation.bridge_augmentation:
  - 448
  - 488
  - 490
  - 491
  - 493
  networkx.algorithms.connectivity.edge_augmentation.collapse:
  - 1088
  - 1090
  - 1091
  - 1092
  - 1093
  - 1096
  - 1098
  - 1100
  - 1103
  - 1105
  - 1106
  - 1107
  - 1046
  - 1110
  networkx.algorithms.connectivity.edge_augmentation.complement_edges:
  - 1150
  - 1142
  - 1143
  - 1144
  - 1145
  - 1146
  - 1147
  - 1149
  - 1118
  - 1151
  networkx.algorithms.connectivity.edge_augmentation.greedy_k_edge_augmentation:
  - 1164
  - 1222
  - 1223
  - 1225
  - 1227
  - 1228
  - 1231
  - 1234
  - 1235
  - 1239
  - 1240
  - 1242
  - 1244
  - 1245
  - 1247
  - 1248
  - 1249
  - 1253
  - 1257
  - 1258
  - 1260
  - 1262
  - 1263
  - 1264
  - 1266
  - 1267
  - 1270
  networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected:
  - 65
  - 69
  - 70
  - 71
  - 72
  - 74
  - 60
  - 30
  - 63
  networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected:
  - 128
  - 129
  - 131
  - 81
  - 120
  - 124
  networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation:
  - 258
  - 259
  - 262
  - 263
  - 266
  - 139
  - 271
  - 283
  - 273
  - 275
  - 276
  - 280
  - 249
  - 251
  - 254
  - 255
  networkx.algorithms.connectivity.edge_augmentation.one_edge_augmentation:
  - 393
  - 436
  - 437
  - 439
  networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation:
  - 384
  - 385
  - 290
  - 355
  - 354
  - 386
  - 358
  - 383
  - 361
  - 364
  - 365
  - 367
  - 371
  - 375
  - 378
  - 381
  - 382
  - 351
  networkx.algorithms.connectivity.edge_augmentation.partial_k_edge_augmentation._edges_between_disjoint:
  - 343
  - 344
  - 345
  - 347
  - 348
  - 349
  networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation:
  - 783
  - 785
  - 790
  - 791
  - 792
  - 793
  - 795
  - 799
  - 803
  - 804
  - 807
  - 808
  - 810
  - 811
  - 815
  - 819
  - 822
  - 823
  - 696
  - 829
  - 830
  - 831
  - 834
  - 835
  - 839
  - 840
  - 842
  - 843
  - 844
  - 845
  networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation.<lambda1>:
  - 834
  networkx.algorithms.connectivity.edge_augmentation.unconstrained_one_edge_augmentation:
  - 611
  - 612
  - 614
  - 584
  - 616
  - 618
  - 619
  - 620
  - 621
  - 622
  networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation:
  - 915
  - 919
  - 920
  - 921
  - 922
  - 924
  - 929
  - 930
  - 933
  - 936
  - 937
  - 944
  - 961
  - 966
  - 970
  - 972
  - 976
  - 977
  - 851
  - 980
  - 982
  - 984
  - 985
  - 987
  - 992
  - 993
  - 999
  - 1009
  - 1010
  - 1011
  - 1012
  - 1015
  - 1017
  networkx.algorithms.connectivity.edge_augmentation.weighted_one_edge_augmentation:
  - 674
  - 677
  - 679
  - 684
  - 685
  - 688
  - 689
  - 627
  - 691
  - 671
  networkx.algorithms.connectivity.edge_kcomponents:
  - 1
  - 198
  - 199
  - 110
  - 26
  - 507
  networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph:
  - 243
  networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct:
  - 359
  - 360
  - 361
  - 365
  - 368
  - 337
  - 369
  - 371
  - 374
  - 378
  - 317
  networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct._recursive_build:
  - 353
  - 355
  - 356
  - 341
  - 344
  - 346
  - 347
  - 349
  - 350
  networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_components:
  - 384
  - 402
  - 407
  - 409
  - 410
  - 411
  - 414
  networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs:
  - 417
  - 450
  - 451
  - 453
  - 454
  - 457
  - 458
  - 437
  - 443
  - 445
  - 446
  - 447
  networkx.algorithms.connectivity.edge_kcomponents._high_degree_components:
  - 483
  - 489
  - 490
  - 493
  - 494
  - 495
  - 496
  - 497
  - 498
  - 501
  - 502
  - 504
  networkx.algorithms.connectivity.edge_kcomponents._k_edge_subgraphs_nodes:
  - 194
  - 195
  - 190
  networkx.algorithms.connectivity.edge_kcomponents._low_degree_nodes:
  - 462
  - 464
  - 466
  - 467
  - 468
  - 469
  - 470
  - 471
  - 472
  - 473
  - 474
  - 477
  - 478
  - 479
  networkx.algorithms.connectivity.edge_kcomponents.bridge_components:
  - 202
  - 237
  - 238
  - 239
  networkx.algorithms.connectivity.edge_kcomponents.general_k_edge_subgraphs:
  - 578
  - 579
  - 580
  - 583
  - 584
  - 585
  - 587
  - 588
  - 589
  - 592
  - 561
  - 566
  - 569
  - 570
  - 571
  - 509
  - 575
  networkx.algorithms.connectivity.edge_kcomponents.k_edge_components:
  - 98
  - 99
  - 101
  - 102
  - 103
  - 104
  - 106
  - 107
  - 29
  - 91
  - 93
  - 94
  - 95
  networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs:
  - 171
  - 173
  - 174
  - 177
  - 113
  - 179
  - 181
  - 184
  - 186
  networkx.algorithms.connectivity.kcomponents:
  - 1
  - 20
  networkx.algorithms.connectivity.kcomponents._consolidate:
  - 160
  - 171
  - 172
  - 173
  - 174
  - 175
  - 177
  - 178
  networkx.algorithms.connectivity.kcomponents._generate_partition:
  - 192
  - 193
  - 187
  - 188
  - 189
  - 190
  - 191
  networkx.algorithms.connectivity.kcomponents._generate_partition.has_nbrs_in_partition:
  - 183
  networkx.algorithms.connectivity.kcomponents._reconstruct_k_components:
  - 198
  - 199
  - 200
  - 201
  - 202
  - 203
  - 205
  - 206
  - 207
  - 208
  - 210
  networkx.algorithms.connectivity.kcomponents.build_k_number_dict:
  - 217
  networkx.algorithms.connectivity.kcomponents.k_components:
  - 129
  - 130
  - 131
  - 133
  - 134
  - 138
  - 139
  - 140
  - 141
  - 142
  - 143
  - 144
  - 145
  - 147
  - 23
  - 156
  - 110
  - 112
  - 115
  - 117
  - 118
  - 119
  - 120
  - 121
  - 122
  - 124
  - 125
  - 126
  - 127
  networkx.algorithms.connectivity.kcutsets:
  - 1
  networkx.algorithms.connectivity.kcutsets._is_separating_set:
  - 232
  - 233
  - 228
  - 229
  networkx.algorithms.connectivity.kcutsets.all_node_cuts:
  - 128
  - 129
  - 130
  - 132
  - 135
  - 136
  - 139
  - 142
  - 145
  - 153
  - 27
  - 156
  - 157
  - 160
  - 162
  - 163
  - 164
  - 170
  - 173
  - 180
  - 181
  - 182
  - 183
  - 184
  - 185
  - 186
  - 187
  - 190
  - 191
  - 192
  - 195
  - 199
  - 202
  - 204
  - 205
  - 206
  - 215
  - 216
  - 218
  - 219
  - 92
  - 220
  - 221
  - 224
  - 98
  - 99
  - 107
  - 112
  - 113
  - 116
  - 118
  - 122
  - 123
  - 126
  networkx.algorithms.connectivity.stoerwagner:
  - 16
  - 1
  - 14
  - 15
  networkx.algorithms.connectivity.stoerwagner.stoer_wagner:
  - 130
  - 132
  - 136
  - 137
  - 138
  - 139
  - 140
  - 143
  - 18
  - 146
  - 148
  - 149
  - 150
  - 88
  - 89
  - 91
  - 95
  - 96
  - 100
  - 101
  - 104
  - 105
  - 109
  - 111
  - 116
  - 117
  - 118
  - 120
  - 121
  - 122
  - 123
  - 124
  - 125
  networkx.algorithms.connectivity.utils:
  - 1
  - 10
  - 63
  networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity:
  - 65
  - 78
  - 79
  - 80
  - 81
  - 84
  - 85
  - 86
  - 87
  networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity:
  - 40
  - 43
  - 12
  - 45
  - 47
  - 48
  - 49
  - 52
  - 53
  - 54
  - 55
  - 56
  networkx.algorithms.core:
  - 1
  - 280
  - 281
  - 409
  - 491
  - 492
  - 45
  - 411
  - 213
  - 214
  - 152
  - 153
  - 410
  - 347
  - 348
  networkx.algorithms.core._core_subgraph:
  - 144
  - 145
  - 146
  - 147
  - 148
  - 149
  - 126
  networkx.algorithms.core.core_number:
  - 98
  - 100
  - 103
  - 104
  - 105
  - 107
  - 110
  - 111
  - 48
  - 112
  - 113
  - 114
  - 92
  networkx.algorithms.core.k_core:
  - 210
  - 155
  networkx.algorithms.core.k_corona:
  - 406
  - 350
  networkx.algorithms.core.k_corona.func:
  - 404
  networkx.algorithms.core.k_crust:
  - 339
  - 340
  - 341
  - 342
  - 344
  - 283
  networkx.algorithms.core.k_shell:
  - 216
  - 277
  networkx.algorithms.core.k_truss:
  - 481
  - 482
  - 483
  - 484
  - 478
  - 485
  - 486
  - 463
  - 470
  - 476
  - 477
  - 413
  - 479
  networkx.algorithms.core.onion_layers:
  - 577
  - 579
  - 581
  - 582
  - 551
  - 574
  - 553
  - 584
  - 558
  - 495
  - 559
  - 560
  - 562
  - 565
  - 567
  - 570
  - 542
  - 575
  networkx.algorithms.covering:
  - 108
  - 1
  - 12
  - 13
  networkx.algorithms.covering.is_edge_cover:
  - 142
  - 111
  networkx.algorithms.covering.min_edge_cover:
  - 101
  - 102
  - 103
  - 104
  - 74
  - 75
  - 76
  - 16
  - 81
  - 82
  - 83
  - 87
  - 93
  - 94
  networkx.algorithms.cuts:
  - 128
  - 1
  - 229
  - 276
  - 85
  - 22
  - 181
  networkx.algorithms.cuts.boundary_expansion:
  - 416
  - 364
  networkx.algorithms.cuts.conductance:
  - 224
  - 225
  - 226
  - 183
  - 221
  - 222
  - 223
  networkx.algorithms.cuts.cut_size:
  - 79
  - 80
  - 81
  - 82
  - 24
  networkx.algorithms.cuts.edge_expansion:
  - 231
  - 270
  - 271
  - 272
  - 273
  networkx.algorithms.cuts.mixing_expansion:
  - 318
  - 317
  - 278
  networkx.algorithms.cuts.node_expansion:
  - 358
  - 326
  - 359
  networkx.algorithms.cuts.normalized_cut_size:
  - 130
  - 173
  - 174
  - 175
  - 176
  - 177
  networkx.algorithms.cuts.volume:
  - 124
  - 125
  - 87
  networkx.algorithms.cycles:
  - 1
  - 770
  - 769
  - 1040
  - 1041
  - 1042
  - 1170
  - 1171
  - 25
  - 26
  networkx.algorithms.cycles._NeighborhoodCache:
  - 341
  networkx.algorithms.cycles._NeighborhoodCache.__missing__:
  - 352
  networkx.algorithms.cycles._bounded_cycle_search:
  - 417
  - 449
  - 450
  - 451
  - 453
  - 454
  - 455
  - 456
  - 457
  - 441
  - 443
  - 445
  networkx.algorithms.cycles._chordless_cycle_search:
  - 739
  - 742
  - 743
  - 746
  - 749
  - 750
  - 752
  - 753
  - 756
  - 693
  - 758
  - 760
  - 761
  networkx.algorithms.cycles._directed_cycle_search:
  - 241
  - 276
  - 278
  - 279
  - 280
  - 281
  - 282
  - 284
  - 286
  - 287
  networkx.algorithms.cycles._johnson_cycle_search:
  - 384
  - 388
  - 357
  - 389
  - 390
  - 392
  - 393
  - 394
  - 395
  - 396
  - 380
  - 381
  - 382
  networkx.algorithms.cycles._min_cycle:
  - 1152
  - 1153
  - 1154
  - 1156
  - 1159
  - 1160
  - 1161
  - 1162
  - 1163
  - 1164
  - 1165
  - 1118
  - 1123
  - 1127
  - 1128
  - 1129
  - 1131
  - 1136
  - 1139
  - 1141
  - 1148
  - 1149
  - 1150
  - 1151
  networkx.algorithms.cycles._min_cycle_basis:
  - 1092
  - 1098
  - 1100
  - 1101
  - 1110
  networkx.algorithms.cycles._undirected_cycle_search:
  - 291
  - 326
  - 328
  - 329
  - 330
  - 331
  - 333
  - 334
  - 336
  - 337
  networkx.algorithms.cycles.chordless_cycles:
  - 640
  - 641
  - 642
  - 643
  - 644
  - 645
  - 647
  - 656
  - 674
  - 676
  - 677
  - 678
  - 680
  - 681
  - 682
  - 684
  - 685
  - 686
  - 687
  - 689
  - 568
  - 569
  - 571
  - 574
  - 575
  - 577
  - 578
  - 580
  - 582
  - 588
  - 590
  - 591
  - 592
  - 594
  - 479
  - 614
  - 615
  - 616
  - 617
  - 618
  - 619
  - 621
  - 622
  - 623
  - 624
  - 625
  - 627
  - 628
  - 629
  - 630
  - 631
  - 632
  - 633
  networkx.algorithms.cycles.chordless_cycles.stems:
  - 664
  - 672
  - 662
  - 663
  networkx.algorithms.cycles.cycle_basis:
  - 96
  - 97
  - 98
  - 99
  - 100
  - 71
  - 74
  - 75
  - 78
  - 80
  - 82
  - 83
  - 85
  - 87
  - 88
  - 89
  - 29
  - 94
  networkx.algorithms.cycles.find_cycle:
  - 1032
  - 1033
  - 1034
  - 948
  - 953
  - 958
  - 965
  - 968
  - 969
  - 980
  - 982
  - 983
  - 986
  - 995
  - 1001
  - 1002
  - 1004
  - 1005
  - 1006
  - 1008
  - 882
  - 1010
  - 1012
  - 1016
  - 1017
  - 1020
  - 1023
  networkx.algorithms.cycles.find_cycle.tailhead:
  - 961
  networkx.algorithms.cycles.girth:
  - 1219
  - 1221
  - 1223
  - 1230
  - 1174
  - 1215
  networkx.algorithms.cycles.minimum_cycle_basis:
  - 1081
  - 1082
  - 1044
  networkx.algorithms.cycles.recursive_simple_cycles:
  - 864
  - 867
  - 772
  - 868
  - 869
  - 870
  - 872
  - 873
  - 876
  - 847
  - 848
  - 854
  - 855
  - 856
  - 857
  - 861
  - 862
  networkx.algorithms.cycles.recursive_simple_cycles.<lambda1>:
  - 868
  networkx.algorithms.cycles.recursive_simple_cycles._unblock:
  - 824
  - 820
  - 821
  networkx.algorithms.cycles.recursive_simple_cycles.circuit:
  - 832
  - 834
  - 835
  - 837
  - 838
  - 840
  - 841
  - 842
  - 843
  - 828
  - 830
  - 831
  networkx.algorithms.cycles.simple_cycles:
  - 198
  - 199
  - 201
  - 204
  - 205
  - 207
  - 210
  - 211
  - 212
  - 213
  - 214
  - 215
  - 218
  - 219
  - 221
  - 224
  - 225
  - 226
  - 227
  - 228
  - 229
  - 231
  - 234
  - 107
  - 235
  - 237
  networkx.algorithms.d_separation:
  - 1
  - 229
  - 588
  - 337
  - 444
  networkx.algorithms.d_separation._reachable:
  - 672
  - 673
  - 674
  - 675
  - 590
  - 659
  - 660
  - 661
  - 662
  - 663
  - 664
  - 665
  - 667
  - 668
  - 671
  networkx.algorithms.d_separation._reachable._pass:
  - 628
  networkx.algorithms.d_separation.find_minimal_d_separator:
  - 419
  - 440
  - 425
  - 394
  - 431
  - 401
  - 402
  - 403
  - 340
  - 435
  - 406
  - 407
  - 408
  - 436
  - 412
  networkx.algorithms.d_separation.is_d_separator:
  - 282
  - 288
  - 293
  - 297
  - 298
  - 301
  - 302
  - 304
  - 307
  - 308
  - 309
  - 310
  - 312
  - 316
  - 318
  - 320
  - 321
  - 322
  - 323
  - 327
  - 329
  - 330
  - 332
  - 232
  networkx.algorithms.d_separation.is_minimal_d_separator:
  - 528
  - 536
  - 537
  - 538
  - 541
  - 542
  - 543
  - 547
  - 554
  - 558
  - 563
  - 564
  - 570
  - 573
  - 574
  - 447
  - 578
  - 582
  - 583
  networkx.algorithms.dag:
  - 1
  - 866
  - 867
  - 454
  - 809
  - 810
  - 939
  - 717
  - 1006
  - 1007
  - 1104
  - 1105
  - 1336
  - 1178
  - 1179
  - 1180
  - 1277
  networkx.algorithms.dag.all_topological_sorts:
  - 515
  - 517
  - 518
  - 521
  - 522
  - 523
  - 528
  - 532
  - 533
  - 539
  - 540
  - 543
  - 551
  - 555
  - 559
  - 562
  - 563
  - 564
  - 567
  - 568
  - 570
  - 457
  - 501
  - 506
  - 508
  networkx.algorithms.dag.ancestors:
  - 109
  - 77
  networkx.algorithms.dag.antichains:
  - 994
  - 998
  - 1000
  - 1003
  - 942
  - 987
  - 988
  - 990
  - 991
  networkx.algorithms.dag.colliders:
  - 1392
  - 1339
  - 1390
  - 1391
  networkx.algorithms.dag.dag_longest_path:
  - 1089
  - 1093
  - 1096
  - 1066
  - 1100
  - 1069
  - 1070
  - 1009
  - 1073
  - 1077
  - 1078
  - 1079
  - 1084
  networkx.algorithms.dag.dag_longest_path.<lambda1>:
  - 1078
  networkx.algorithms.dag.dag_longest_path_length:
  - 1153
  - 1154
  - 1107
  - 1146
  - 1148
  - 1149
  - 1150
  - 1151
  networkx.algorithms.dag.dag_longest_path_length.<lambda1>:
  - 1150
  networkx.algorithms.dag.dag_to_branching:
  - 1266
  - 1269
  - 1270
  - 1272
  - 1273
  - 1182
  networkx.algorithms.dag.descendants:
  - 40
  - 72
  networkx.algorithms.dag.has_cycle:
  - 114
  - 117
  networkx.algorithms.dag.is_aperiodic:
  - 576
  - 705
  - 706
  - 707
  - 708
  - 710
  - 692
  - 694
  - 696
  - 698
  networkx.algorithms.dag.is_directed_acyclic_graph:
  - 162
  - 126
  networkx.algorithms.dag.lexicographical_topological_sort:
  - 449
  - 418
  - 423
  - 425
  - 426
  - 429
  - 431
  - 433
  - 438
  - 440
  - 409
  - 314
  - 413
  - 447
  networkx.algorithms.dag.lexicographical_topological_sort.create_tuple:
  - 421
  networkx.algorithms.dag.root_to_leaf_paths:
  - 1161
  - 1171
  - 1172
  - 1173
  - 1175
  networkx.algorithms.dag.topological_generations:
  - 224
  - 225
  - 227
  - 229
  - 167
  - 232
  - 233
  - 235
  - 237
  - 214
  - 217
  - 218
  - 219
  networkx.algorithms.dag.topological_sort:
  - 309
  - 308
  - 245
  networkx.algorithms.dag.transitive_closure:
  - 800
  - 801
  - 803
  - 804
  - 719
  - 791
  - 793
  - 796
  - 797
  - 798
  - 799
  networkx.algorithms.dag.transitive_closure_dag:
  - 812
  - 853
  - 854
  - 856
  - 860
  - 861
  networkx.algorithms.dag.transitive_reduction:
  - 928
  - 929
  - 930
  - 869
  - 933
  - 935
  - 917
  - 920
  - 921
  - 924
  - 925
  - 926
  - 927
  networkx.algorithms.dag.v_structures:
  - 1280
  - 1331
  - 1332
  - 1333
  networkx.algorithms.distance_measures:
  - 1
  - 481
  - 553
  - 695
  - 619
  - 781
  - 782
  - 1006
  - 919
  - 337
  - 1007
  - 406
  - 246
  - 918
  networkx.algorithms.distance_measures._extrema_bounding:
  - 128
  - 141
  - 144
  - 145
  - 148
  - 149
  - 150
  - 23
  - 151
  - 154
  - 160
  - 166
  - 173
  - 180
  - 181
  - 186
  - 200
  - 201
  - 211
  - 98
  - 99
  - 100
  - 231
  - 104
  - 105
  - 106
  - 233
  - 235
  - 238
  - 241
  - 116
  - 123
  - 125
  networkx.algorithms.distance_measures.barycenter:
  - 768
  - 769
  - 771
  - 774
  - 775
  - 776
  - 777
  - 751
  - 752
  - 753
  - 755
  - 756
  - 761
  - 758
  - 759
  - 697
  - 762
  - 763
  networkx.algorithms.distance_measures.center:
  - 684
  - 621
  - 686
  - 687
  - 685
  - 688
  - 689
  - 690
  networkx.algorithms.distance_measures.diameter:
  - 399
  - 400
  - 401
  - 402
  - 339
  - 403
  networkx.algorithms.distance_measures.eccentricity:
  - 320
  - 321
  - 330
  - 332
  - 307
  - 309
  - 310
  - 311
  - 248
  - 313
  - 317
  networkx.algorithms.distance_measures.effective_graph_resistance:
  - 992
  - 995
  - 999
  - 1003
  - 981
  - 921
  - 986
  - 985
  - 989
  - 990
  - 991
  networkx.algorithms.distance_measures.harmonic_diameter:
  - 455
  - 458
  - 459
  - 460
  - 464
  - 468
  - 471
  - 408
  - 474
  - 476
  networkx.algorithms.distance_measures.kemeny_constant:
  - 1088
  - 1092
  - 1095
  - 1009
  - 1074
  - 1076
  - 1078
  - 1082
  - 1084
  - 1085
  - 1086
  - 1087
  networkx.algorithms.distance_measures.periphery:
  - 544
  - 545
  - 546
  - 483
  - 547
  - 548
  networkx.algorithms.distance_measures.radius:
  - 612
  - 613
  - 614
  - 615
  - 616
  - 555
  networkx.algorithms.distance_measures.resistance_distance:
  - 897
  - 898
  - 899
  - 904
  - 905
  - 907
  - 908
  - 910
  - 911
  - 784
  - 912
  - 913
  - 854
  - 856
  - 858
  - 860
  - 863
  - 864
  - 867
  - 868
  - 869
  - 872
  - 877
  - 878
  - 881
  - 882
  - 883
  - 884
  - 886
  - 887
  - 889
  - 890
  - 891
  - 894
  - 895
  networkx.algorithms.distance_regular:
  - 1
  - 116
  - 117
  - 219
  - 220
  networkx.algorithms.distance_regular.global_parameters:
  - 73
  - 113
  networkx.algorithms.distance_regular.intersection_array:
  - 166
  - 169
  - 177
  - 178
  - 181
  - 182
  - 183
  - 187
  - 190
  - 195
  - 197
  - 198
  - 199
  - 203
  - 205
  - 207
  - 213
  - 214
  - 120
  networkx.algorithms.distance_regular.is_distance_regular:
  - 26
  - 66
  networkx.algorithms.distance_regular.is_strongly_regular:
  - 272
  - 223
  networkx.algorithms.dominance:
  - 1
  - 93
  - 13
  networkx.algorithms.dominance.dominance_frontiers:
  - 96
  - 132
  - 134
  - 135
  - 136
  - 137
  - 138
  - 140
  networkx.algorithms.dominance.immediate_dominators:
  - 67
  - 68
  - 69
  - 70
  - 16
  - 83
  - 84
  - 85
  - 62
  networkx.algorithms.dominating:
  - 1
  - 109
  - 239
  networkx.algorithms.dominating.connected_dominating_set:
  - 188
  - 189
  - 191
  - 194
  - 195
  - 200
  - 203
  - 206
  - 207
  - 211
  - 215
  - 217
  - 221
  - 223
  - 224
  - 227
  - 228
  - 229
  - 230
  - 232
  - 234
  - 112
  networkx.algorithms.dominating.dominating_set:
  - 64
  - 65
  - 69
  - 19
  - 54
  - 55
  - 56
  - 57
  - 60
  networkx.algorithms.dominating.is_connected_dominating_set:
  - 242
  - 268
  networkx.algorithms.dominating.is_dominating_set:
  - 105
  - 106
  - 77
  networkx.algorithms.efficiency_measures:
  - 123
  - 1
  - 11
  - 62
  networkx.algorithms.efficiency_measures.efficiency:
  - 56
  - 14
  networkx.algorithms.efficiency_measures.global_efficiency:
  - 65
  - 104
  - 106
  - 107
  - 109
  - 110
  - 111
  networkx.algorithms.efficiency_measures.local_efficiency:
  - 166
  - 126
  - 167
  networkx.algorithms.euler:
  - 1
  - 389
  - 390
  networkx.algorithms.euler._find_path_start:
  - 96
  - 98
  - 99
  - 101
  - 108
  - 88
  - 92
  - 95
  networkx.algorithms.euler._multigraph_eulerian_circuit:
  - 135
  - 146
  - 147
  - 148
  - 150
  - 152
  - 154
  - 155
  networkx.algorithms.euler._simplegraph_eulerian_circuit:
  - 129
  - 130
  - 131
  - 113
  - 123
  - 124
  - 125
  - 127
  networkx.algorithms.euler.eulerian_circuit:
  - 160
  - 224
  - 226
  - 227
  - 228
  - 229
  - 230
  - 231
  - 232
  - 234
  - 236
  - 221
  - 223
  networkx.algorithms.euler.eulerian_path:
  - 384
  - 385
  - 336
  - 356
  - 358
  - 359
  - 360
  - 361
  - 362
  - 363
  - 364
  - 365
  - 367
  - 369
  - 371
  - 372
  - 373
  - 374
  - 375
  - 376
  - 377
  - 380
  - 381
  networkx.algorithms.euler.eulerize:
  - 449
  - 455
  - 392
  - 456
  - 457
  - 458
  - 459
  - 460
  - 432
  - 464
  - 434
  - 467
  - 436
  - 437
  - 438
  - 469
  - 443
  - 444
  networkx.algorithms.euler.has_eulerian_path:
  - 323
  - 327
  - 331
  - 302
  - 241
  - 305
  - 309
  - 314
  - 315
  - 317
  - 319
  networkx.algorithms.euler.is_eulerian:
  - 65
  - 66
  - 67
  - 70
  - 23
  - 62
  networkx.algorithms.euler.is_semieulerian:
  - 75
  - 84
  networkx.algorithms.flow.boykovkolmogorov:
  - 1
  - 14
  networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov:
  - 160
  - 18
  - 158
  networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl:
  - 352
  - 353
  - 165
  - 357
  - 167
  - 359
  - 169
  - 361
  - 172
  - 173
  - 180
  - 181
  - 343
  - 344
  - 188
  networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl._has_valid_root:
  - 322
  - 323
  - 326
  - 332
  - 333
  networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.adopt:
  - 288
  - 289
  - 295
  - 296
  - 297
  - 298
  - 278
  networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.augment:
  - 257
  - 258
  - 260
  - 261
  - 230
  - 263
  - 266
  - 267
  - 269
  - 270
  - 239
  - 272
  - 274
  - 247
  - 248
  - 249
  - 251
  networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov_impl.grow:
  - 226
  - 195
  - 205
  - 213
  - 214
  - 215
  - 216
  - 221
  - 222
  networkx.algorithms.flow.capacityscaling:
  - 152
  - 1
  - 41
  networkx.algorithms.flow.capacityscaling._build_flow_dict:
  - 128
  - 129
  - 130
  - 133
  - 138
  - 109
  - 110
  - 141
  - 112
  - 113
  - 143
  - 115
  - 145
  - 146
  - 121
  - 125
  - 127
  networkx.algorithms.flow.capacityscaling._build_residual_network:
  - 43
  - 44
  - 47
  - 48
  - 49
  - 52
  - 54
  - 55
  - 62
  - 65
  - 66
  - 71
  - 72
  - 80
  - 81
  - 83
  - 91
  - 92
  - 93
  - 97
  - 98
  - 103
  networkx.algorithms.flow.capacityscaling._detect_unboundedness:
  - 32
  - 34
  - 16
  - 17
  - 18
  - 23
  - 24
  - 25
  - 28
  - 29
  - 30
  - 31
  networkx.algorithms.flow.capacityscaling.capacity_scaling:
  - 384
  - 385
  - 386
  - 389
  - 393
  - 396
  - 400
  - 401
  - 402
  - 404
  - 407
  - 285
  - 158
  - 287
  - 289
  - 291
  - 293
  - 297
  - 298
  - 300
  - 305
  - 309
  - 311
  - 312
  - 314
  - 316
  - 322
  - 323
  - 328
  - 330
  - 331
  - 332
  - 333
  - 337
  - 343
  - 346
  - 348
  - 350
  - 355
  - 356
  - 360
  - 361
  - 363
  - 367
  - 371
  - 373
  - 383
  networkx.algorithms.flow.dinitz_alg:
  - 1
  - 14
  networkx.algorithms.flow.dinitz_alg.dinitz:
  - 16
  - 137
  - 139
  networkx.algorithms.flow.dinitz_alg.dinitz_impl:
  - 165
  - 229
  - 230
  - 232
  - 233
  - 144
  - 146
  - 148
  - 151
  - 152
  - 157
  - 158
  networkx.algorithms.flow.dinitz_alg.dinitz_impl.breath_first_search:
  - 174
  - 177
  - 179
  - 180
  - 181
  - 182
  - 183
  - 184
  - 186
  - 188
  networkx.algorithms.flow.dinitz_alg.dinitz_impl.depth_first_search:
  - 193
  - 200
  - 202
  - 204
  - 205
  - 208
  - 210
  - 212
  - 213
  - 214
  - 218
  - 219
  - 221
  networkx.algorithms.flow.edmondskarp:
  - 120
  - 1
  networkx.algorithms.flow.edmondskarp.edmonds_karp:
  - 240
  - 124
  - 238
  networkx.algorithms.flow.edmondskarp.edmonds_karp_core:
  - 74
  - 75
  - 12
  - 82
  - 83
  - 88
  - 89
  networkx.algorithms.flow.edmondskarp.edmonds_karp_core.augment:
  - 32
  - 33
  - 34
  - 20
  - 23
  - 24
  - 25
  - 27
  - 29
  networkx.algorithms.flow.edmondskarp.edmonds_karp_core.bidirectional_bfs:
  - 64
  - 66
  - 67
  - 41
  - 48
  - 49
  - 50
  - 51
  - 53
  - 55
  - 56
  - 60
  - 61
  - 62
  networkx.algorithms.flow.edmondskarp.edmonds_karp_impl:
  - 96
  - 98
  - 100
  - 103
  - 104
  - 109
  - 110
  - 113
  - 114
  - 115
  - 95
  networkx.algorithms.flow.gomory_hu:
  - 16
  - 1
  - 17
  networkx.algorithms.flow.gomory_hu.gomory_hu_tree:
  - 163
  - 164
  - 134
  - 166
  - 168
  - 137
  - 175
  - 144
  - 145
  - 146
  - 19
  - 176
  - 177
  - 150
  - 153
  - 157
  networkx.algorithms.flow.maxflow:
  - 1
  - 171
  - 20
  - 311
  - 474
  networkx.algorithms.flow.maxflow.maximum_flow:
  - 162
  - 165
  - 166
  - 22
  - 154
  - 155
  networkx.algorithms.flow.maxflow.maximum_flow_value:
  - 295
  - 296
  - 173
  - 303
  - 306
  networkx.algorithms.flow.maxflow.minimum_cut:
  - 452
  - 455
  - 458
  - 460
  - 461
  - 466
  - 467
  - 470
  - 313
  - 444
  - 445
  networkx.algorithms.flow.maxflow.minimum_cut_value:
  - 609
  - 595
  - 596
  - 603
  - 476
  - 606
  networkx.algorithms.flow.mincost:
  - 1
  - 195
  - 102
  - 10
  - 255
  networkx.algorithms.flow.mincost.cost_of_flow:
  - 252
  - 197
  networkx.algorithms.flow.mincost.max_flow_min_cost:
  - 352
  - 257
  - 354
  - 355
  - 353
  - 356
  networkx.algorithms.flow.mincost.min_cost_flow:
  - 192
  - 106
  networkx.algorithms.flow.mincost.min_cost_flow_cost:
  - 99
  - 14
  networkx.algorithms.flow.networksimplex:
  - 328
  - 1
  - 329
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.__init__:
  - 33
  - 34
  - 36
  - 38
  - 39
  - 40
  - 41
  - 42
  - 43
  - 44
  - 46
  - 47
  - 19
  - 20
  - 22
  - 27
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.add_edge:
  - 241
  - 222
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.augment_flow:
  - 144
  - 140
  - 143
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_apex:
  - 99
  - 100
  - 87
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_cycle:
  - 128
  - 129
  - 130
  - 131
  - 132
  - 133
  - 121
  - 127
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_entering_edges:
  - 290
  - 291
  - 292
  - 297
  - 267
  - 268
  - 303
  - 275
  - 283
  - 284
  - 287
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_leaving_edge:
  - 320
  - 321
  - 322
  - 319
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.find_leaving_edge.<lambda1>:
  - 322
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.initialize_spanning_tree:
  - 65
  - 66
  - 67
  - 72
  - 73
  - 74
  - 76
  - 77
  - 78
  - 80
  - 81
  - 82
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.make_root:
  - 192
  - 210
  - 184
  - 189
  - 191
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.reduced_cost:
  - 258
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.remove_edge:
  - 160
  - 179
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.residual_capacity:
  - 309
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_path:
  - 117
  - 115
  - 109
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.trace_subtree:
  - 153
  - 157
  - 150
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions.update_potentials:
  - 250
  - 246
  - 254
  networkx.algorithms.flow.networksimplex.network_simplex:
  - 512
  - 513
  - 514
  - 640
  - 516
  - 517
  - 641
  - 519
  - 520
  - 642
  - 522
  - 523
  - 524
  - 644
  - 647
  - 648
  - 649
  - 650
  - 651
  - 531
  - 652
  - 533
  - 534
  - 654
  - 536
  - 537
  - 660
  - 539
  - 540
  - 541
  - 553
  - 556
  - 557
  - 558
  - 560
  - 561
  - 564
  - 565
  - 566
  - 567
  - 572
  - 573
  - 574
  - 577
  - 583
  - 584
  - 585
  - 586
  - 588
  - 333
  - 589
  - 592
  - 595
  - 596
  - 597
  - 598
  - 604
  - 607
  - 608
  - 609
  - 655
  - 656
  - 618
  - 498
  - 501
  - 504
  - 639
  networkx.algorithms.flow.networksimplex.network_simplex.add_entry:
  - 624
  - 622
  networkx.algorithms.flow.preflowpush:
  - 1
  - 291
  networkx.algorithms.flow.preflowpush.preflow_push:
  - 424
  - 422
  - 295
  networkx.algorithms.flow.preflowpush.preflow_push_impl:
  - 259
  - 267
  - 268
  - 275
  - 23
  - 24
  - 280
  - 26
  - 281
  - 28
  - 282
  - 284
  - 31
  - 285
  - 33
  - 36
  - 37
  - 41
  - 48
  - 50
  - 69
  - 71
  - 77
  - 80
  - 83
  - 86
  - 88
  - 99
  - 228
  - 101
  - 102
  - 105
  - 106
  - 107
  - 236
  - 109
  - 110
  - 237
  - 112
  - 238
  - 241
  - 243
  - 244
  - 249
  - 255
  networkx.algorithms.flow.preflowpush.preflow_push_impl.activate:
  - 115
  - 116
  - 118
  - 119
  - 120
  networkx.algorithms.flow.preflowpush.preflow_push_impl.discharge:
  - 160
  - 161
  - 165
  - 135
  - 144
  - 146
  - 147
  - 148
  - 149
  - 150
  - 151
  - 153
  - 156
  networkx.algorithms.flow.preflowpush.preflow_push_impl.gap_heuristic:
  - 176
  - 178
  - 179
  - 181
  - 183
  - 184
  - 185
  - 186
  networkx.algorithms.flow.preflowpush.preflow_push_impl.global_relabel:
  - 192
  - 195
  - 196
  - 199
  - 200
  - 204
  - 208
  - 210
  - 211
  - 212
  - 213
  - 215
  - 216
  - 189
  - 191
  networkx.algorithms.flow.preflowpush.preflow_push_impl.push:
  - 91
  networkx.algorithms.flow.preflowpush.preflow_push_impl.relabel:
  - 128
  - 123
  - 124
  - 126
  networkx.algorithms.flow.preflowpush.preflow_push_impl.reverse_bfs:
  - 65
  - 54
  - 58
  - 60
  - 62
  - 63
  networkx.algorithms.flow.shortestaugmentingpath:
  - 1
  - 166
  networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path:
  - 177
  - 299
  - 297
  networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl:
  - 130
  - 131
  - 132
  - 143
  - 16
  - 17
  - 146
  - 19
  - 21
  - 149
  - 24
  - 25
  - 152
  - 153
  - 160
  - 34
  - 35
  - 40
  - 42
  - 44
  - 45
  - 47
  - 49
  - 55
  - 56
  - 59
  - 61
  - 65
  - 99
  - 100
  - 107
  - 114
  - 115
  - 117
  - 121
  - 124
  networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.augment:
  - 71
  - 74
  - 75
  - 76
  - 78
  - 80
  - 83
  - 84
  - 85
  networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path_impl.relabel:
  - 96
  - 92
  - 94
  - 95
  networkx.algorithms.flow.utils:
  - 80
  - 1
  - 163
  - 185
  networkx.algorithms.flow.utils.CurrentEdge:
  - 20
  networkx.algorithms.flow.utils.CurrentEdge.__eq__:
  - 46
  - 47
  networkx.algorithms.flow.utils.CurrentEdge.__init__:
  - 28
  - 29
  networkx.algorithms.flow.utils.CurrentEdge._rewind:
  - 42
  - 43
  networkx.algorithms.flow.utils.CurrentEdge.move_to_next:
  - 36
  - 38
  networkx.algorithms.flow.utils.GlobalRelabelThreshold:
  - 62
  networkx.algorithms.flow.utils.GlobalRelabelThreshold.__init__:
  - 67
  networkx.algorithms.flow.utils.Level:
  - 52
  networkx.algorithms.flow.utils.Level.__init__:
  - 57
  - 58
  networkx.algorithms.flow.utils.build_flow_dict:
  - 192
  - 187
  - 189
  - 191
  networkx.algorithms.flow.utils.build_residual_network:
  - 132
  - 106
  - 139
  - 140
  - 109
  - 141
  - 111
  - 142
  - 113
  - 82
  - 145
  - 146
  - 117
  - 118
  - 151
  - 153
  - 154
  - 155
  networkx.algorithms.flow.utils.detect_unboundedness:
  - 169
  - 170
  - 174
  - 175
  - 176
  - 177
  - 181
  - 182
  networkx.algorithms.graph_hashing:
  - 1
  - 229
  - 230
  - 71
  - 72
  networkx.algorithms.graph_hashing._hash_label:
  - 17
  networkx.algorithms.graph_hashing._init_node_labels:
  - 32
  - 33
  - 35
  - 21
  - 22
  - 23
  - 26
  networkx.algorithms.graph_hashing._neighborhood_aggregate_directed:
  - 66
  - 67
  - 51
  - 56
  - 57
  - 58
  - 61
  - 62
  - 63
  networkx.algorithms.graph_hashing._neighborhood_aggregate_undirected:
  - 39
  - 44
  - 45
  - 46
  - 47
  networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash:
  - 226
  - 76
  - 207
  - 211
  - 215
  - 184
  - 186
  - 219
  - 220
  - 221
  - 223
  networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.weisfeiler_lehman_step:
  - 204
  - 202
  - 203
  - 196
  networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes:
  - 385
  - 417
  - 420
  - 415
  - 424
  - 426
  - 427
  - 428
  - 430
  - 239
  - 431
  - 435
  - 410
  - 413
  - 383
  networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.weisfeiler_lehman_step:
  - 395
  - 403
  - 404
  - 405
  - 407
  networkx.algorithms.graphical:
  - 96
  - 1
  - 328
  - 17
  - 277
  - 375
  - 186
  networkx.algorithms.graphical._basic_graphical_tests:
  - 78
  - 79
  - 82
  - 84
  - 87
  - 88
  - 91
  networkx.algorithms.graphical.is_digraphical:
  - 420
  - 421
  - 426
  - 427
  - 429
  - 432
  - 434
  - 436
  - 438
  - 440
  - 441
  - 442
  - 443
  - 444
  - 445
  - 447
  - 448
  - 454
  - 456
  - 461
  - 462
  - 463
  - 466
  - 467
  - 470
  - 475
  - 477
  - 478
  - 480
  - 481
  - 482
  - 377
  networkx.algorithms.graphical.is_graphical:
  - 66
  - 67
  - 68
  - 69
  - 19
  networkx.algorithms.graphical.is_multigraphical:
  - 320
  - 322
  - 323
  - 279
  - 315
  - 319
  networkx.algorithms.graphical.is_pseudographical:
  - 369
  - 330
  - 372
  networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai:
  - 260
  - 261
  - 263
  - 265
  - 268
  - 272
  - 251
  - 188
  - 255
  networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi:
  - 98
  - 164
  - 172
  - 176
  - 180
  - 149
  - 153
  networkx.algorithms.hierarchy:
  - 1
  - 10
  networkx.algorithms.hierarchy.flow_hierarchy:
  - 12
  - 52
  - 54
  - 56
  - 57
  networkx.algorithms.hybrid:
  - 1
  - 14
  networkx.algorithms.hybrid.is_kl_connected:
  - 192
  - 161
  - 164
  - 166
  - 167
  - 168
  - 170
  - 177
  - 182
  - 183
  - 184
  - 121
  - 188
  networkx.algorithms.hybrid.kl_connected_subgraph:
  - 65
  - 97
  - 98
  - 99
  - 103
  - 75
  - 107
  - 108
  - 78
  - 110
  - 16
  - 80
  - 81
  - 82
  - 83
  - 85
  - 114
  - 92
  networkx.algorithms.isolate:
  - 1
  networkx.algorithms.isolate.is_isolate:
  - 40
  - 12
  networkx.algorithms.isolate.isolates:
  - 45
  - 86
  networkx.algorithms.isolate.number_of_isolates:
  - 107
  - 91
  networkx.algorithms.isomorphism.ismags:
  - 1
  networkx.algorithms.isomorphism.ismags.EdgeLookup:
  - 287
  networkx.algorithms.isomorphism.ismags.EdgeLookup.__getitem__:
  - 308
  networkx.algorithms.isomorphism.ismags.EdgeLookup.items:
  - 313
  networkx.algorithms.isomorphism.ismags.ISMAGS:
  - 317
  networkx.algorithms.isomorphism.ismags.ISMAGS.__init__:
  - 489
  - 525
  - 529
  - 530
  - 532
  - 533
  - 536
  - 537
  - 538
  - 540
  - 541
  - 511
  networkx.algorithms.isomorphism.ismags.ISMAGS._find_permutations:
  - 1189
  - 1190
  - 1191
  - 1196
  - 1203
  - 1204
  - 1182
  networkx.algorithms.isomorphism.ismags.ISMAGS._get_color_degree_candidates:
  - 705
  - 706
  - 708
  - 709
  - 712
  - 694
  - 699
  - 700
  networkx.algorithms.isomorphism.ismags.ISMAGS._get_node_color_candidate_sets:
  - 834
  - 847
  - 848
  - 850
  - 851
  - 853
  - 854
  networkx.algorithms.isomorphism.ismags.ISMAGS._get_permutations_by_length:
  - 1120
  - 1121
  - 1122
  - 1124
  - 1125
  - 1126
  - 1106
  networkx.algorithms.isomorphism.ismags.ISMAGS._largest_common_subgraph:
  - 1026
  - 1027
  - 1058
  - 1059
  - 1063
  - 1034
  - 1037
  - 1069
  - 1070
  - 1071
  - 1044
  - 1054
  - 1046
  - 1047
  - 1081
  - 1082
  - 1084
  - 1022
  networkx.algorithms.isomorphism.ismags.ISMAGS._largest_common_subgraph.<lambda1>:
  - 1046
  networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes:
  - 897
  - 899
  - 900
  - 904
  - 905
  - 917
  - 919
  - 923
  - 925
  - 929
  - 935
  - 936
  - 940
  - 946
  - 949
  - 951
  - 952
  - 954
  - 964
  - 966
  - 967
  - 969
  - 971
  - 973
  - 974
  - 980
  - 990
  - 992
  - 994
  - 995
  - 996
  - 997
  - 1001
  - 878
  - 1006
  - 1007
  - 1009
  - 1010
  - 1013
  networkx.algorithms.isomorphism.ismags.ISMAGS._map_nodes.<lambda1>:
  - 1007
  networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions:
  - 1281
  - 1284
  - 1285
  - 1288
  - 1290
  - 1291
  - 1292
  - 1295
  - 1297
  - 1214
  - 1221
  - 1225
  - 1243
  - 1248
  - 1249
  - 1257
  - 1259
  - 1261
  - 1263
  - 1266
  - 1268
  - 1274
  - 1277
  networkx.algorithms.isomorphism.ismags.ISMAGS._process_ordered_pair_partitions._load_next_queue_entry:
  - 1232
  - 1234
  - 1236
  - 1238
  - 1240
  networkx.algorithms.isomorphism.ismags.ISMAGS._refine_node_partition:
  - 869
  - 870
  - 873
  - 874
  - 861
  - 862
  - 863
  networkx.algorithms.isomorphism.ismags.ISMAGS._refine_opp:
  - 1152
  - 1155
  - 1156
  - 1157
  - 1159
  - 1160
  - 1165
  - 1170
  - 1171
  - 1174
  - 1178
  - 1134
  - 1138
  - 1139
  - 1140
  - 1141
  - 1142
  - 1143
  - 1149
  - 1150
  - 1151
  networkx.algorithms.isomorphism.ismags.ISMAGS._remove_node:
  - 1097
  - 1090
  - 1098
  networkx.algorithms.isomorphism.ismags.ISMAGS.analyze_subgraph_symmetry:
  - 773
  - 774
  - 776
  - 777
  - 778
  - 779
  - 780
  - 783
  - 785
  - 786
  - 789
  - 758
  networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions:
  - 544
  - 554
  - 555
  - 556
  - 561
  - 562
  - 563
  - 574
  - 585
  - 586
  - 591
  - 592
  - 593
  - 594
  - 597
  - 600
  - 608
  - 620
  - 622
  - 623
  - 624
  - 627
  - 628
  - 629
  - 630
  - 631
  - 632
  - 633
  - 634
  networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.g_match:
  - 577
  - 583
  networkx.algorithms.isomorphism.ismags.ISMAGS.create_aligned_partitions.sg_match:
  - 572
  - 566
  networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms:
  - 673
  - 677
  - 679
  - 680
  - 681
  - 683
  - 656
  - 657
  - 671
  - 659
  - 688
  - 661
  - 689
  - 663
  - 690
  - 666
  - 670
  - 639
  networkx.algorithms.isomorphism.ismags.ISMAGS.find_isomorphisms.<lambda1>:
  - 688
  networkx.algorithms.isomorphism.ismags.ISMAGS.is_isomorphic:
  - 794
  - 802
  networkx.algorithms.isomorphism.ismags.ISMAGS.isomorphisms_iter:
  - 826
  - 827
  - 822
  networkx.algorithms.isomorphism.ismags.ISMAGS.largest_common_subgraph:
  - 736
  - 739
  - 740
  - 742
  - 746
  - 716
  - 748
  - 750
  - 751
  - 733
  - 734
  networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_is_isomorphic:
  - 818
  - 807
  networkx.algorithms.isomorphism.ismags.ISMAGS.subgraph_isomorphisms_iter:
  - 830
  - 831
  networkx.algorithms.isomorphism.ismags.are_all_equal:
  - 133
  - 153
  - 157
  - 158
  - 159
  networkx.algorithms.isomorphism.ismags.color_degree_by_node:
  - 280
  - 263
  - 264
  - 265
  - 267
  - 270
  - 272
  - 273
  - 279
  - 248
  - 282
  networkx.algorithms.isomorphism.ismags.make_partition:
  - 163
  - 196
  - 197
  - 198
  - 195
  - 199
  - 227
  - 204
  - 205
  - 206
  - 208
  - 215
  - 216
  - 220
  networkx.algorithms.isomorphism.ismags.node_to_part_ID_dict:
  - 244
  - 231
  networkx.algorithms.isomorphism.isomorph:
  - 1
  - 225
  - 178
  - 19
  - 123
  networkx.algorithms.isomorphism.isomorph.could_be_isomorphic:
  - 64
  - 96
  - 97
  - 67
  - 98
  - 99
  - 84
  - 85
  - 21
  - 86
  - 87
  - 90
  - 91
  - 92
  - 93
  networkx.algorithms.isomorphism.isomorph.could_be_isomorphic._properties_consistent:
  - 72
  - 73
  - 75
  networkx.algorithms.isomorphism.isomorph.fast_could_be_isomorphic:
  - 140
  - 144
  - 145
  - 147
  - 149
  - 150
  - 152
  - 154
  - 125
  networkx.algorithms.isomorphism.isomorph.fast_graph_could_be_isomorphic:
  - 170
  - 162
  - 175
  networkx.algorithms.isomorphism.isomorph.faster_could_be_isomorphic:
  - 194
  - 198
  - 199
  - 201
  - 180
  networkx.algorithms.isomorphism.isomorph.faster_graph_could_be_isomorphic:
  - 209
  - 217
  - 222
  networkx.algorithms.isomorphism.isomorph.graph_could_be_isomorphic:
  - 115
  - 107
  - 120
  networkx.algorithms.isomorphism.isomorph.is_isomorphic:
  - 327
  - 231
  - 329
  - 334
  - 336
  networkx.algorithms.isomorphism.isomorphvf2:
  - 1
  networkx.algorithms.isomorphism.isomorphvf2.DiGMState:
  - 1136
  networkx.algorithms.isomorphism.isomorphvf2.DiGMState.__init__:
  - 1157
  - 1159
  - 1169
  - 1180
  - 1183
  - 1184
  - 1186
  - 1187
  - 1193
  - 1194
  - 1195
  - 1198
  - 1202
  - 1203
  - 1207
  - 1208
  - 1209
  - 1212
  - 1216
  - 1217
  - 1221
  - 1222
  - 1223
  - 1226
  - 1230
  - 1231
  - 1235
  - 1236
  - 1237
  - 1240
  - 1244
  - 1245
  - 1146
  networkx.algorithms.isomorphism.isomorphvf2.DiGMState.restore:
  - 1249
  - 1253
  - 1259
  - 1260
  - 1261
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher:
  - 623
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.__init__:
  - 642
  - 629
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.candidate_pairs_iter:
  - 677
  - 678
  - 679
  - 648
  - 680
  - 687
  - 688
  - 689
  - 690
  - 662
  - 663
  - 664
  - 665
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.initialize:
  - 723
  - 726
  - 695
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_is_isomorphic:
  - 972
  - 951
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_is_monomorphic:
  - 996
  - 975
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_isomorphisms_iter:
  - 1020
  - 999
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.subgraph_monomorphisms_iter:
  - 1044
  - 1023
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher.syntactic_feasibility:
  - 768
  - 897
  - 898
  - 900
  - 901
  - 904
  - 778
  - 779
  - 780
  - 781
  - 783
  - 785
  - 915
  - 788
  - 789
  - 790
  - 916
  - 792
  - 793
  - 919
  - 795
  - 920
  - 922
  - 798
  - 923
  - 800
  - 926
  - 933
  - 934
  - 808
  - 809
  - 810
  - 811
  - 937
  - 813
  - 938
  - 815
  - 940
  - 941
  - 818
  - 819
  - 820
  - 944
  - 822
  - 823
  - 825
  - 828
  - 830
  - 833
  - 840
  - 841
  - 844
  - 845
  - 847
  - 848
  - 851
  - 729
  - 857
  - 858
  - 861
  - 862
  - 864
  - 865
  - 868
  - 876
  - 877
  - 880
  - 881
  - 883
  - 884
  - 887
  - 762
  - 763
  - 893
  - 894
  networkx.algorithms.isomorphism.isomorphvf2.GMState:
  - 1048
  networkx.algorithms.isomorphism.isomorphvf2.GMState.__init__:
  - 1057
  - 1089
  - 1092
  - 1094
  - 1115
  - 1068
  - 1100
  - 1070
  - 1101
  - 1102
  - 1105
  - 1106
  - 1078
  - 1110
  - 1111
  - 1112
  - 1116
  networkx.algorithms.isomorphism.isomorphvf2.GMState.restore:
  - 1120
  - 1123
  - 1129
  - 1130
  - 1131
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher:
  - 155
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.__init__:
  - 161
  - 195
  - 196
  - 197
  - 200
  - 201
  - 202
  - 204
  - 177
  - 210
  - 180
  - 181
  - 187
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.candidate_pairs_iter:
  - 256
  - 257
  - 229
  - 243
  - 244
  - 245
  - 246
  - 252
  - 254
  - 255
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.initialize:
  - 290
  - 262
  - 287
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.is_isomorphic:
  - 293
  - 300
  - 304
  - 305
  - 306
  - 310
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.isomorphisms_iter:
  - 320
  - 316
  - 319
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.match:
  - 323
  - 331
  - 333
  - 335
  - 337
  - 338
  - 339
  - 341
  - 342
  - 345
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.reset_recursion_limit:
  - 216
  - 226
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.semantic_feasibility:
  - 348
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_is_isomorphic:
  - 410
  - 388
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_is_monomorphic:
  - 416
  - 438
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_isomorphisms_iter:
  - 468
  - 444
  - 469
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.subgraph_monomorphisms_iter:
  - 472
  - 496
  - 495
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher.syntactic_feasibility:
  - 534
  - 535
  - 540
  - 550
  - 551
  - 552
  - 553
  - 555
  - 557
  - 560
  - 561
  - 562
  - 564
  - 565
  - 567
  - 570
  - 572
  - 575
  - 582
  - 583
  - 586
  - 587
  - 589
  - 590
  - 593
  - 604
  - 605
  - 608
  - 609
  - 611
  - 612
  - 615
  - 499
  networkx.algorithms.isomorphism.matchhelpers:
  - 352
  - 1
  - 121
  - 217
  - 181
  - 278
  - 119
  - 120
  - 89
  - 218
  - 219
  networkx.algorithms.isomorphism.matchhelpers.allclose:
  - 41
  - 30
  networkx.algorithms.isomorphism.matchhelpers.categorical_multiedge_match:
  - 101
  - 93
  networkx.algorithms.isomorphism.matchhelpers.categorical_multiedge_match.match:
  - 96
  - 97
  - 104
  - 105
  - 106
  - 107
  - 108
  - 109
  - 110
  - 111
  networkx.algorithms.isomorphism.matchhelpers.categorical_node_match:
  - 81
  - 75
  networkx.algorithms.isomorphism.matchhelpers.categorical_node_match.match:
  - 84
  - 78
  networkx.algorithms.isomorphism.matchhelpers.copyfunc:
  - 24
  - 23
  networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match:
  - 320
  - 282
  - 324
  networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match.match:
  - 328
  - 329
  - 330
  - 332
  - 333
  - 334
  - 335
  - 336
  - 337
  networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match.match.<lambda1>:
  - 337
  networkx.algorithms.isomorphism.matchhelpers.generic_node_match:
  - 266
  - 260
  networkx.algorithms.isomorphism.matchhelpers.generic_node_match.match:
  - 269
  - 270
  - 263
  networkx.algorithms.isomorphism.matchhelpers.numerical_multiedge_match:
  - 185
  - 193
  networkx.algorithms.isomorphism.matchhelpers.numerical_multiedge_match.match:
  - 197
  - 198
  - 199
  - 201
  - 202
  - 203
  - 204
  - 205
  - 206
  - 207
  - 188
  - 189
  - 190
  networkx.algorithms.isomorphism.matchhelpers.numerical_node_match:
  - 160
  - 171
  networkx.algorithms.isomorphism.matchhelpers.numerical_node_match.match:
  - 163
  - 164
  - 165
  - 174
  - 175
  - 176
  networkx.algorithms.isomorphism.temporalisomorphvf2:
  - 1
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.__init__:
  - 146
  - 167
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_pred_dates:
  - 170
  - 174
  - 175
  - 176
  - 178
  - 179
  - 182
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.get_succ_dates:
  - 192
  - 194
  - 195
  - 198
  - 186
  - 190
  - 191
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.one_hop:
  - 202
  - 205
  - 206
  - 207
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.preds:
  - 242
  - 243
  - 244
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.semantic_feasibility:
  - 288
  - 296
  - 297
  - 299
  - 303
  - 305
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.succs:
  - 248
  - 249
  - 250
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_one:
  - 265
  - 266
  - 254
  - 262
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.test_two:
  - 271
  - 276
  - 277
  - 279
  - 280
  - 281
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.two_hop_pred:
  - 212
  - 215
  - 216
  - 220
  - 221
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher.two_hop_succ:
  - 227
  - 230
  - 231
  - 235
  - 236
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.__init__:
  - 98
  - 77
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.one_hop:
  - 101
  - 106
  - 107
  - 108
  - 110
  - 113
  - 114
  - 116
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.semantic_feasibility:
  - 128
  - 138
  - 136
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher.two_hop:
  - 122
  - 123
  - 119
  networkx.algorithms.isomorphism.tree_isomorphism:
  - 1
  - 194
  - 195
  - 196
  - 76
  - 29
  networkx.algorithms.isomorphism.tree_isomorphism.root_trees:
  - 68
  - 70
  - 41
  - 44
  - 52
  - 53
  - 55
  - 57
  - 59
  - 61
  - 31
  networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism:
  - 131
  - 134
  - 135
  - 136
  - 139
  - 150
  - 153
  - 155
  - 158
  - 162
  - 166
  - 171
  - 173
  - 179
  - 183
  - 184
  - 185
  - 78
  - 124
  - 126
  networkx.algorithms.isomorphism.tree_isomorphism.tree_isomorphism:
  - 257
  - 260
  - 198
  - 264
  - 233
  - 235
  - 240
  - 245
  - 246
  - 248
  - 252
  - 253
  networkx.algorithms.isomorphism.vf2pp:
  - 1
  - 167
  - 138
  - 107
  - 77
  - 90
  networkx.algorithms.isomorphism.vf2pp._consistent_PT:
  - 804
  - 805
  - 806
  - 811
  - 814
  - 815
  - 816
  - 756
  - 821
  - 822
  - 823
  - 825
  - 797
  - 798
  - 799
  networkx.algorithms.isomorphism.vf2pp._cut_PT:
  - 689
  - 690
  - 693
  - 697
  - 700
  - 701
  - 704
  - 707
  - 710
  - 712
  - 713
  - 714
  - 716
  - 720
  - 722
  - 724
  - 725
  - 729
  - 732
  - 735
  - 737
  - 738
  - 739
  - 741
  - 745
  - 747
  - 749
  - 636
  networkx.algorithms.isomorphism.vf2pp._feasibility:
  - 625
  - 579
  - 628
  - 629
  networkx.algorithms.isomorphism.vf2pp._find_candidates:
  - 512
  - 513
  - 451
  - 515
  - 516
  - 517
  - 518
  - 519
  - 523
  - 494
  - 495
  - 496
  - 497
  - 498
  - 499
  - 500
  - 504
  - 510
  networkx.algorithms.isomorphism.vf2pp._find_candidates_Di:
  - 536
  - 537
  - 538
  - 539
  - 540
  - 541
  - 542
  - 546
  - 551
  - 553
  - 555
  - 556
  - 558
  - 559
  - 561
  - 562
  - 564
  - 565
  - 566
  - 567
  - 568
  - 572
  networkx.algorithms.isomorphism.vf2pp._initialize_parameters:
  - 352
  - 354
  - 356
  - 357
  - 359
  - 298
  - 334
  - 335
  - 337
  - 342
  - 343
  - 344
  - 347
  - 348
  - 349
  - 351
  networkx.algorithms.isomorphism.vf2pp._matching_order:
  - 416
  - 420
  - 408
  - 422
  - 423
  - 425
  - 429
  - 433
  - 434
  - 404
  - 437
  - 438
  - 407
  - 376
  - 441
  - 410
  - 411
  - 443
  networkx.algorithms.isomorphism.vf2pp._precheck_label_properties:
  - 289
  - 290
  - 291
  networkx.algorithms.isomorphism.vf2pp._restore_Tinout:
  - 993
  - 994
  - 997
  - 998
  - 1000
  - 1002
  - 1004
  - 1005
  - 1007
  - 1008
  - 978
  - 979
  - 982
  - 986
  - 988
  - 989
  - 926
  networkx.algorithms.isomorphism.vf2pp._restore_Tinout_Di:
  - 1028
  - 1029
  - 1032
  - 1036
  - 1037
  - 1039
  - 1040
  - 1042
  - 1043
  - 1044
  - 1046
  - 1047
  - 1050
  - 1054
  - 1055
  - 1057
  - 1058
  - 1060
  - 1061
  - 1065
  - 1066
  - 1069
  - 1070
  - 1072
  - 1074
  - 1075
  - 1077
  - 1078
  - 1080
  - 1081
  - 1082
  - 1084
  - 1085
  - 1088
  - 1092
  - 1093
  - 1095
  - 1096
  - 1098
  - 1099
  - 1101
  - 1102
  networkx.algorithms.isomorphism.vf2pp._update_Tinout:
  - 832
  - 897
  - 896
  - 899
  - 900
  - 901
  - 902
  - 904
  - 914
  - 915
  - 916
  - 917
  - 919
  - 920
  - 921
  - 922
  - 894
  - 895
  networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms:
  - 256
  - 260
  - 261
  - 262
  - 265
  - 267
  - 268
  - 270
  - 276
  - 278
  - 279
  - 283
  - 169
  - 191
  - 195
  - 198
  - 202
  - 205
  - 206
  - 208
  - 216
  - 218
  - 222
  - 228
  - 232
  - 236
  - 237
  - 239
  - 251
  - 254
  networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic:
  - 162
  - 140
  networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism:
  - 132
  - 109
  networkx.algorithms.isomorphism.vf2userfunc:
  - 1
  networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher:
  - 121
  networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.__init__:
  - 155
  - 124
  networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher.semantic_feasibility:
  - 168
  - 169
  - 165
  - 175
  networkx.algorithms.isomorphism.vf2userfunc.GraphMatcher:
  - 74
  networkx.algorithms.isomorphism.vf2userfunc.GraphMatcher.__init__:
  - 108
  - 77
  networkx.algorithms.isomorphism.vf2userfunc.MultiDiGraphMatcher:
  - 192
  networkx.algorithms.isomorphism.vf2userfunc.MultiGraphMatcher:
  - 188
  networkx.algorithms.isomorphism.vf2userfunc._semantic_feasibility:
  - 64
  - 40
  - 42
  - 43
  - 44
  - 48
  - 55
  - 57
  - 58
  - 62
  networkx.algorithms.link_analysis.hits_alg:
  - 8
  - 1
  networkx.algorithms.link_analysis.hits_alg._hits_numpy:
  - 224
  - 225
  - 227
  - 228
  - 229
  - 230
  - 212
  - 214
  - 151
  - 217
  - 218
  - 221
  - 222
  - 223
  networkx.algorithms.link_analysis.hits_alg._hits_python:
  - 128
  - 131
  - 132
  - 135
  - 136
  - 140
  - 141
  - 142
  - 144
  - 145
  - 100
  - 102
  - 105
  - 106
  - 110
  - 111
  - 113
  - 115
  - 116
  - 119
  - 120
  - 121
  - 123
  - 124
  - 125
  - 127
  networkx.algorithms.link_analysis.hits_alg._hits_scipy:
  - 321
  - 323
  - 324
  - 326
  - 330
  - 235
  - 332
  - 333
  - 334
  - 335
  - 304
  - 336
  - 306
  - 310
  - 311
  - 313
  - 314
  networkx.algorithms.link_analysis.hits_alg.hits:
  - 10
  - 76
  - 78
  - 80
  - 81
  - 82
  - 85
  - 89
  - 91
  - 92
  - 93
  - 94
  - 95
  networkx.algorithms.link_analysis.pagerank_alg:
  - 8
  - 1
  - 175
  networkx.algorithms.link_analysis.pagerank_alg._pagerank_numpy:
  - 353
  - 354
  - 355
  - 274
  - 344
  - 346
  - 350
  - 351
  networkx.algorithms.link_analysis.pagerank_alg._pagerank_python:
  - 128
  - 131
  - 132
  - 135
  - 136
  - 139
  - 140
  - 142
  - 144
  - 146
  - 147
  - 149
  - 153
  - 154
  - 155
  - 158
  - 160
  - 161
  - 162
  - 165
  - 167
  - 169
  - 170
  - 125
  networkx.algorithms.link_analysis.pagerank_alg._pagerank_scipy:
  - 455
  - 456
  - 459
  - 460
  - 461
  - 463
  - 467
  - 468
  - 470
  - 471
  - 474
  - 475
  - 477
  - 478
  - 480
  - 482
  - 486
  - 487
  - 488
  - 491
  - 493
  - 495
  - 368
  - 496
  - 497
  networkx.algorithms.link_analysis.pagerank_alg.google_matrix:
  - 259
  - 260
  - 261
  - 266
  - 237
  - 238
  - 240
  - 241
  - 242
  - 179
  - 246
  - 247
  - 249
  - 250
  - 252
  - 255
  networkx.algorithms.link_analysis.pagerank_alg.pagerank:
  - 19
  - 110
  networkx.algorithms.link_prediction:
  - 1
  - 410
  - 411
  - 412
  - 48
  - 49
  - 176
  - 177
  - 583
  - 584
  - 585
  - 348
  - 349
  - 111
  - 112
  - 240
  - 498
  - 241
  - 496
  - 497
  networkx.algorithms.link_prediction._apply_prediction:
  - 37
  - 38
  - 40
  - 41
  - 43
  - 45
  - 23
  networkx.algorithms.link_prediction._community:
  - 680
  networkx.algorithms.link_prediction.adamic_adar_index:
  - 180
  - 237
  networkx.algorithms.link_prediction.adamic_adar_index.predict:
  - 235
  networkx.algorithms.link_prediction.cn_soundarajan_hopcroft:
  - 493
  - 414
  networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.predict:
  - 485
  - 486
  - 487
  - 489
  - 491
  networkx.algorithms.link_prediction.common_neighbor_centrality:
  - 325
  - 334
  - 335
  - 244
  - 345
  networkx.algorithms.link_prediction.common_neighbor_centrality.predict:
  - 328
  - 331
  - 338
  - 340
  - 342
  - 343
  networkx.algorithms.link_prediction.jaccard_coefficient:
  - 115
  - 173
  networkx.algorithms.link_prediction.jaccard_coefficient.predict:
  - 168
  - 169
  - 171
  networkx.algorithms.link_prediction.preferential_attachment:
  - 352
  - 407
  networkx.algorithms.link_prediction.preferential_attachment.predict:
  - 405
  networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft:
  - 500
  - 580
  networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.predict:
  - 577
  - 578
  - 573
  - 574
  - 575
  networkx.algorithms.link_prediction.resource_allocation_index:
  - 108
  - 52
  networkx.algorithms.link_prediction.resource_allocation_index.predict:
  - 106
  networkx.algorithms.link_prediction.within_inter_cluster:
  - 587
  - 676
  - 663
  networkx.algorithms.link_prediction.within_inter_cluster.predict:
  - 672
  - 674
  - 667
  - 668
  - 669
  - 671
  networkx.algorithms.lowest_common_ancestors:
  - 1
  - 126
  - 164
  - 17
  networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor:
  - 123
  - 78
  - 80
  - 83
  - 20
  - 84
  - 87
  - 89
  - 90
  - 91
  networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.generate_lca_from_pairs:
  - 100
  - 101
  - 102
  - 103
  - 104
  - 105
  - 106
  - 110
  - 111
  - 114
  - 115
  - 118
  - 121
  networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor:
  - 129
  - 157
  - 158
  - 159
  networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor:
  - 256
  - 261
  - 263
  - 266
  - 267
  - 269
  - 270
  - 273
  - 274
  - 275
  - 276
  - 277
  - 278
  - 279
  - 167
  - 224
  - 228
  - 229
  - 231
  - 232
  - 233
  - 234
  - 235
  - 236
  - 238
  - 239
  - 245
  - 246
  - 247
  - 248
  - 253
  networkx.algorithms.matching:
  - 320
  - 1
  - 260
  - 261
  - 262
  - 18
  - 19
  - 318
  - 319
  networkx.algorithms.matching.is_matching:
  - 129
  - 130
  - 131
  - 134
  - 136
  - 138
  - 140
  - 142
  - 87
  - 126
  - 127
  networkx.algorithms.matching.is_maximal_matching:
  - 192
  - 194
  - 195
  - 196
  - 200
  - 201
  - 203
  - 177
  - 178
  - 180
  - 148
  - 181
  - 182
  - 183
  - 186
  - 188
  - 190
  networkx.algorithms.matching.is_perfect_matching:
  - 256
  - 257
  - 240
  - 241
  - 210
  - 243
  - 244
  - 245
  - 248
  - 250
  - 252
  - 254
  networkx.algorithms.matching.matching_dict_to_set:
  - 74
  - 75
  - 77
  - 79
  - 81
  - 61
  networkx.algorithms.matching.max_weight_matching:
  - 1024
  - 1027
  - 1038
  - 1040
  - 1044
  - 1045
  - 1046
  - 1047
  - 1054
  - 1055
  - 1057
  - 1058
  - 1060
  - 1061
  - 1066
  - 1072
  - 1073
  - 1075
  - 1082
  - 1088
  - 1091
  - 1092
  - 1095
  - 1098
  - 1099
  - 1100
  - 1103
  - 1108
  - 1111
  - 1116
  - 1117
  - 1122
  - 1123
  - 1125
  - 1130
  - 1134
  - 1138
  - 1139
  - 1141
  - 1142
  - 1145
  - 1146
  - 1148
  - 322
  - 935
  - 936
  - 425
  - 426
  - 427
  - 939
  - 940
  - 432
  - 433
  - 434
  - 945
  - 436
  - 951
  - 952
  - 953
  - 969
  - 973
  - 974
  - 467
  - 979
  - 982
  - 983
  - 472
  - 984
  - 987
  - 476
  - 988
  - 991
  - 992
  - 996
  - 997
  - 1000
  - 492
  - 1004
  - 1007
  - 1015
  - 1018
  - 1020
  networkx.algorithms.matching.max_weight_matching.Blossom:
  - 398
  networkx.algorithms.matching.max_weight_matching.Blossom.leaves:
  - 418
  - 419
  - 420
  - 422
  networkx.algorithms.matching.max_weight_matching.NoNode:
  - 395
  networkx.algorithms.matching.max_weight_matching.addBlossom:
  - 641
  - 644
  - 645
  - 647
  - 650
  - 652
  - 653
  - 658
  - 662
  - 663
  - 664
  - 580
  - 591
  - 592
  - 600
  - 601
  - 602
  - 607
  - 608
  - 622
  - 623
  - 626
  - 630
  - 631
  - 632
  networkx.algorithms.matching.max_weight_matching.assignLabel:
  - 515
  - 517
  - 522
  - 524
  - 525
  - 527
  - 528
  - 533
  networkx.algorithms.matching.max_weight_matching.augmentBlossom:
  - 840
  - 843
  - 844
  networkx.algorithms.matching.max_weight_matching.augmentBlossom._recurse:
  - 800
  - 802
  - 803
  - 805
  - 815
  - 819
  - 820
  - 824
  - 825
  - 799
  networkx.algorithms.matching.max_weight_matching.augmentMatching:
  - 864
  - 868
  - 878
  - 879
  - 852
  - 863
  networkx.algorithms.matching.max_weight_matching.expandBlossom:
  - 777
  - 778
  - 774
  networkx.algorithms.matching.max_weight_matching.expandBlossom._recurse:
  - 678
  - 680
  - 681
  - 683
  - 685
  - 691
  - 699
  - 700
  - 702
  - 711
  - 717
  - 721
  - 741
  - 746
  - 747
  - 748
  - 754
  - 759
  - 762
  - 763
  - 764
  networkx.algorithms.matching.max_weight_matching.scanBlossom:
  - 545
  - 549
  - 552
  - 564
  - 567
  networkx.algorithms.matching.max_weight_matching.slack:
  - 509
  networkx.algorithms.matching.max_weight_matching.verifyOptimum:
  - 896
  - 897
  - 898
  - 904
  - 906
  - 907
  - 908
  - 909
  - 910
  - 914
  - 918
  - 921
  - 922
  - 923
  - 924
  - 885
  - 888
  - 892
  - 893
  networkx.algorithms.matching.maximal_matching:
  - 48
  - 49
  - 50
  - 55
  - 22
  - 54
  - 56
  networkx.algorithms.matching.min_weight_matching:
  - 264
  - 308
  - 309
  - 310
  - 311
  - 312
  - 314
  - 315
  networkx.algorithms.minors:
  - 1
  networkx.algorithms.minors.contraction:
  - 1
  - 99
  - 428
  - 653
  networkx.algorithms.minors.contraction._quotient_graph:
  - 385
  - 395
  - 398
  - 399
  - 401
  - 402
  - 406
  - 413
  - 415
  - 419
  - 423
  - 424
  - 350
  - 351
  - 352
  - 354
  - 357
  - 369
  - 370
  - 378
  networkx.algorithms.minors.contraction._quotient_graph.edge_data:
  - 393
  - 390
  networkx.algorithms.minors.contraction._quotient_graph.edge_relation:
  - 381
  networkx.algorithms.minors.contraction._quotient_graph.node_data:
  - 360
  - 363
  - 364
  - 365
  networkx.algorithms.minors.contraction.contracted_edge:
  - 729
  - 659
  - 731
  networkx.algorithms.minors.contraction.contracted_nodes:
  - 641
  - 642
  - 611
  - 612
  - 615
  - 619
  - 622
  - 434
  - 626
  - 629
  - 630
  - 601
  - 634
  - 635
  - 604
  - 605
  - 607
  networkx.algorithms.minors.contraction.equivalence_classes:
  - 89
  - 96
  - 82
  - 86
  - 22
  - 88
  - 87
  networkx.algorithms.minors.contraction.quotient_graph:
  - 323
  - 324
  - 329
  - 330
  - 331
  - 333
  - 110
  - 303
  - 335
  - 305
  - 306
  - 310
  networkx.algorithms.mis:
  - 1
  - 12
  - 13
  networkx.algorithms.mis.maximal_independent_set:
  - 64
  - 66
  - 67
  - 69
  - 70
  - 72
  - 73
  - 75
  - 76
  - 77
  - 16
  - 63
  networkx.algorithms.moral:
  - 1
  - 11
  - 12
  networkx.algorithms.moral.moral_graph:
  - 14
  - 55
  - 56
  - 57
  - 58
  networkx.algorithms.node_classification:
  - 32
  - 1
  - 107
  - 108
  - 31
  networkx.algorithms.node_classification._get_label_info:
  - 208
  - 209
  - 211
  - 214
  - 215
  - 216
  - 217
  - 187
  networkx.algorithms.node_classification.harmonic_function:
  - 34
  - 98
  - 101
  - 104
  - 79
  - 80
  - 82
  - 89
  - 92
  - 94
  - 95
  networkx.algorithms.node_classification.local_and_global_consistency:
  - 160
  - 167
  - 170
  - 172
  - 173
  - 110
  - 177
  - 180
  - 183
  - 157
  - 158
  networkx.algorithms.non_randomness:
  - 1
  - 11
  - 12
  - 13
  networkx.algorithms.non_randomness.non_randomness:
  - 130
  - 132
  - 134
  - 137
  - 138
  - 140
  - 141
  - 142
  - 15
  - 149
  - 150
  - 153
  networkx.algorithms.operators.all:
  - 1
  - 167
  - 233
  - 10
  - 113
  networkx.algorithms.operators.all.compose_all:
  - 224
  - 227
  - 169
  - 212
  - 213
  - 215
  - 216
  - 218
  - 221
  - 222
  - 223
  networkx.algorithms.operators.all.disjoint_union_all:
  - 162
  - 115
  networkx.algorithms.operators.all.disjoint_union_all.yield_relabeled:
  - 160
  - 158
  - 159
  networkx.algorithms.operators.all.intersection_all:
  - 321
  - 322
  - 297
  - 298
  - 235
  - 300
  - 299
  - 301
  - 302
  - 304
  - 305
  - 307
  - 310
  - 312
  - 318
  networkx.algorithms.operators.all.union_all:
  - 69
  - 101
  - 102
  - 103
  - 104
  - 107
  - 12
  - 81
  - 82
  - 84
  - 85
  - 86
  - 88
  - 89
  - 91
  - 93
  networkx.algorithms.operators.all.union_all.add_prefix:
  - 73
  - 79
  networkx.algorithms.operators.binary:
  - 1
  - 137
  - 300
  - 237
  - 83
  - 19
  - 182
  - 382
  networkx.algorithms.operators.binary.compose:
  - 379
  - 302
  networkx.algorithms.operators.binary.difference:
  - 224
  - 227
  - 228
  - 230
  - 231
  - 232
  - 233
  - 184
  - 220
  - 222
  networkx.algorithms.operators.binary.disjoint_union:
  - 85
  - 134
  networkx.algorithms.operators.binary.full_join:
  - 384
  - 457
  - 458
  - 460
  - 461
  - 462
  - 463
  - 464
  - 465
  - 466
  - 446
  networkx.algorithms.operators.binary.full_join.add_prefix:
  - 449
  - 455
  networkx.algorithms.operators.binary.intersection:
  - 139
  - 179
  networkx.algorithms.operators.binary.symmetric_difference:
  - 268
  - 270
  - 272
  - 275
  - 276
  - 277
  - 278
  - 280
  - 281
  - 283
  - 286
  - 287
  - 288
  - 290
  - 291
  - 293
  - 294
  - 295
  - 296
  - 239
  networkx.algorithms.operators.binary.union:
  - 80
  - 21
  networkx.algorithms.operators.product:
  - 128
  - 1
  - 289
  - 477
  - 541
  - 476
  - 236
  - 437
  - 438
  - 184
  - 347
  - 348
  - 349
  - 478
  networkx.algorithms.operators.product._dict_product:
  - 24
  networkx.algorithms.operators.product._directed_edges_cross_edges:
  - 34
  - 35
  - 36
  - 37
  - 38
  - 39
  - 40
  - 41
  - 42
  - 43
  - 44
  - 45
  - 46
  - 47
  - 48
  - 49
  networkx.algorithms.operators.product._edges_cross_nodes:
  - 72
  - 73
  - 74
  - 75
  - 77
  - 78
  - 79
  - 80
  - 82
  networkx.algorithms.operators.product._edges_cross_nodes_and_nodes:
  - 100
  - 101
  - 102
  - 103
  - 104
  - 106
  - 107
  - 108
  - 109
  - 110
  - 112
  networkx.algorithms.operators.product._init_product_graph:
  - 116
  - 119
  - 120
  - 122
  - 123
  - 124
  networkx.algorithms.operators.product._node_product:
  - 29
  - 30
  networkx.algorithms.operators.product._nodes_cross_edges:
  - 96
  - 86
  - 87
  - 88
  - 89
  - 91
  - 92
  - 93
  - 94
  networkx.algorithms.operators.product._undirected_edges_cross_edges:
  - 64
  - 65
  - 66
  - 67
  - 68
  - 53
  - 54
  - 55
  - 56
  - 57
  - 58
  - 59
  - 60
  - 61
  - 62
  - 63
  networkx.algorithms.operators.product.cartesian_product:
  - 229
  - 230
  - 231
  - 232
  - 186
  networkx.algorithms.operators.product.corona_product:
  - 480
  - 522
  - 523
  - 524
  - 526
  - 528
  - 531
  - 532
  - 536
  networkx.algorithms.operators.product.lexicographic_product:
  - 238
  - 280
  - 281
  - 283
  - 285
  networkx.algorithms.operators.product.modular_product:
  - 608
  - 545
  - 612
  - 617
  - 618
  - 620
  - 621
  - 622
  - 623
  - 625
  - 626
  - 628
  - 629
  - 630
  - 631
  networkx.algorithms.operators.product.power:
  - 417
  - 351
  - 424
  - 425
  - 427
  - 429
  - 430
  - 433
  - 412
  - 414
  - 415
  networkx.algorithms.operators.product.rooted_product:
  - 464
  - 467
  - 468
  - 470
  - 471
  - 440
  networkx.algorithms.operators.product.strong_product:
  - 291
  - 337
  - 338
  - 339
  - 340
  - 341
  - 342
  - 343
  networkx.algorithms.operators.product.tensor_product:
  - 130
  - 176
  - 177
  - 178
  - 179
  - 180
  networkx.algorithms.operators.unary:
  - 8
  - 1
  - 44
  networkx.algorithms.operators.unary.complement:
  - 36
  - 37
  - 38
  - 39
  - 10
  networkx.algorithms.operators.unary.reverse:
  - 74
  - 77
  - 46
  networkx.algorithms.perfect_graph:
  - 10
  - 11
  networkx.algorithms.perfect_graph.is_perfect_graph:
  - 68
  - 69
  - 70
  - 71
  - 13
  networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos:
  - 98
  - 38
  - 122
  - 104
  - 9
  - 42
  - 46
  - 80
  - 115
  - 86
  - 118
  - 58
  - 92
  networkx.algorithms.planar_drawing.get_canonical_ordering:
  - 260
  - 141
  - 270
  - 277
  - 280
  - 281
  - 283
  - 284
  - 287
  - 288
  - 290
  - 291
  - 292
  - 295
  - 296
  - 300
  - 189
  - 190
  - 191
  - 196
  - 204
  - 219
  - 220
  - 221
  - 223
  - 226
  - 229
  - 230
  - 232
  - 234
  - 235
  - 241
  - 243
  - 244
  - 247
  - 249
  - 251
  - 254
  networkx.algorithms.planar_drawing.get_canonical_ordering.is_outer_face_nbr:
  - 209
  - 211
  networkx.algorithms.planar_drawing.make_bi_connected:
  - 448
  - 439
  - 449
  - 450
  - 451
  - 454
  - 455
  - 459
  - 429
  - 462
  - 432
  - 438
  - 406
  - 443
  - 446
  networkx.algorithms.planar_drawing.set_position:
  - 129
  - 137
  - 132
  networkx.algorithms.planar_drawing.triangulate_embedding:
  - 385
  - 386
  - 391
  - 392
  - 394
  - 363
  - 364
  - 365
  - 396
  - 368
  - 337
  - 371
  - 374
  - 379
  - 380
  - 381
  - 382
  - 383
  networkx.algorithms.planar_drawing.triangulate_face:
  - 324
  - 329
  - 330
  - 333
  - 308
  - 317
  - 318
  - 319
  networkx.algorithms.planarity:
  - 42
  - 134
  - 173
  - 118
  networkx.algorithms.planarity.ConflictPair:
  - 225
  networkx.algorithms.planarity.ConflictPair.lowest:
  - 242
  - 243
  - 245
  - 247
  networkx.algorithms.planarity.ConflictPair.swap:
  - 236
  networkx.algorithms.planarity.Interval:
  - 197
  networkx.algorithms.planarity.Interval.conflicting:
  - 217
  - 219
  networkx.algorithms.planarity.Interval.copy:
  - 213
  - 214
  networkx.algorithms.planarity.Interval.empty:
  - 209
  networkx.algorithms.planarity.LRPlanarity:
  - 260
  networkx.algorithms.planarity.LRPlanarity.__init__:
  - 288
  - 289
  - 321
  - 294
  - 301
  - 304
  - 305
  - 310
  - 311
  - 285
  - 286
  - 287
  networkx.algorithms.planarity.LRPlanarity.add_constraints:
  - 642
  - 645
  - 646
  - 651
  - 652
  - 612
  - 615
  - 616
  - 617
  - 618
  - 620
  - 622
  - 623
  - 629
  - 632
  - 635
  - 636
  - 637
  - 638
  networkx.algorithms.planarity.LRPlanarity.dfs_embedding:
  - 704
  - 708
  - 709
  - 713
  - 714
  - 717
  - 718
  - 720
  - 695
  - 699
  - 702
  networkx.algorithms.planarity.LRPlanarity.dfs_embedding_recursive:
  - 738
  - 724
  - 725
  - 727
  - 728
  - 731
  - 733
  - 735
  networkx.algorithms.planarity.LRPlanarity.dfs_orientation:
  - 450
  - 454
  - 487
  - 456
  - 459
  - 491
  - 492
  - 462
  - 493
  - 495
  - 465
  - 466
  - 496
  - 498
  - 470
  - 474
  - 478
  - 479
  networkx.algorithms.planarity.LRPlanarity.dfs_orientation_recursive:
  - 513
  - 516
  - 522
  - 526
  - 527
  - 528
  - 530
  - 531
  - 533
  - 503
  - 505
  - 506
  - 509
  networkx.algorithms.planarity.LRPlanarity.dfs_testing:
  - 545
  - 577
  - 579
  - 580
  - 550
  - 553
  - 554
  - 568
  - 556
  - 557
  - 558
  - 564
  - 567
  - 536
  - 571
  - 540
  - 542
  networkx.algorithms.planarity.LRPlanarity.dfs_testing_recursive:
  - 608
  - 585
  - 587
  - 589
  - 590
  - 591
  - 595
  - 598
  - 599
  - 602
  - 607
  networkx.algorithms.planarity.LRPlanarity.lr_planarity:
  - 389
  - 390
  - 324
  - 331
  - 336
  - 337
  - 340
  - 341
  - 343
  - 344
  - 352
  - 354
  - 355
  - 357
  - 358
  - 368
  - 369
  - 371
  - 372
  - 374
  - 375
  - 379
  - 380
  networkx.algorithms.planarity.LRPlanarity.lr_planarity_recursive:
  - 403
  - 404
  - 409
  - 410
  - 412
  - 413
  - 419
  - 421
  - 422
  - 424
  - 425
  - 428
  - 429
  - 431
  - 432
  - 434
  - 435
  - 439
  - 440
  - 444
  - 445
  networkx.algorithms.planarity.LRPlanarity.remove_back_edges:
  - 677
  - 682
  - 685
  - 686
  - 687
  - 689
  - 659
  - 660
  - 661
  - 664
  - 665
  - 669
  networkx.algorithms.planarity.LRPlanarity.sign:
  - 742
  - 746
  - 749
  - 751
  - 752
  - 753
  networkx.algorithms.planarity.LRPlanarity.sign_recursive:
  - 762
  - 763
  - 764
  networkx.algorithms.planarity.PlanarEmbedding:
  - 770
  networkx.algorithms.planarity.PlanarEmbedding.__init__:
  - 860
  networkx.algorithms.planarity.PlanarEmbedding._forbidden:
  - 866
  networkx.algorithms.planarity.PlanarEmbedding.add_half_edge:
  - 1060
  - 1061
  - 1082
  - 1064
  - 1072
  - 1010
  - 1043
  - 1044
  - 1076
  - 1046
  - 1047
  - 1048
  - 1079
  - 1050
  - 1053
  networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_ccw:
  - 1169
  - 1143
  networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_cw:
  - 1172
  - 1197
  networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first:
  - 1304
  - 1322
  - 1323
  - 1319
  networkx.algorithms.planarity.PlanarEmbedding.check_structure:
  - 1120
  - 1121
  - 1122
  - 1125
  - 1128
  - 1129
  - 1131
  - 1102
  - 1135
  - 1104
  - 1137
  - 1109
  - 1110
  - 1113
  - 1115
  - 1085
  networkx.algorithms.planarity.PlanarEmbedding.connect_components:
  - 1292
  - 1293
  - 1296
  - 1297
  - 1298
  - 1301
  - 1274
  networkx.algorithms.planarity.PlanarEmbedding.copy:
  - 1393
  - 1394
  - 1395
  - 1396
  - 1397
  - 1398
  - 1399
  - 1400
  - 1401
  networkx.algorithms.planarity.PlanarEmbedding.get_data:
  - 890
  - 891
  - 876
  networkx.algorithms.planarity.PlanarEmbedding.is_directed:
  - 1384
  networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order:
  - 999
  - 1002
  - 1003
  - 1006
  - 987
  networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge:
  - 1326
  networkx.algorithms.planarity.PlanarEmbedding.remove_edge:
  - 1200
  - 1228
  - 1238
  - 1231
  networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from:
  - 1241
  - 1266
  - 1270
  - 1271
  networkx.algorithms.planarity.PlanarEmbedding.remove_node:
  - 945
  - 955
  - 939
  - 917
  networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from:
  - 982
  - 981
  - 958
  - 983
  networkx.algorithms.planarity.PlanarEmbedding.set_data:
  - 912
  - 913
  - 910
  - 895
  networkx.algorithms.planarity.PlanarEmbedding.to_undirected:
  - 1444
  - 1451
  - 1454
  - 1455
  - 1456
  - 1457
  - 1458
  - 1459
  - 1460
  - 1461
  - 1406
  networkx.algorithms.planarity.PlanarEmbedding.traverse_face:
  - 1376
  - 1377
  - 1379
  - 1364
  - 1365
  - 1368
  - 1341
  - 1375
  networkx.algorithms.planarity.check_planarity:
  - 105
  - 106
  - 107
  - 44
  - 109
  - 110
  networkx.algorithms.planarity.check_planarity_recursive:
  - 120
  - 121
  - 122
  - 123
  - 125
  - 126
  networkx.algorithms.planarity.get_counterexample:
  - 161
  - 162
  - 163
  - 164
  - 165
  - 166
  - 167
  - 136
  - 168
  - 155
  - 157
  networkx.algorithms.planarity.get_counterexample_recursive:
  - 175
  - 178
  - 180
  - 184
  - 185
  - 186
  - 187
  - 188
  - 189
  - 190
  - 191
  networkx.algorithms.planarity.is_planar:
  - 11
  - 39
  networkx.algorithms.planarity.top_of_stack:
  - 253
  - 254
  networkx.algorithms.polynomials:
  - 1
  - 183
  - 33
  networkx.algorithms.polynomials.chromatic_polynomial:
  - 288
  - 289
  - 290
  - 294
  - 295
  - 296
  - 297
  - 300
  - 302
  - 303
  - 304
  - 305
  - 186
  networkx.algorithms.polynomials.tutte_polynomial:
  - 162
  - 163
  - 36
  - 166
  - 167
  - 170
  - 171
  - 172
  - 175
  - 176
  - 177
  - 178
  - 179
  - 180
  - 155
  - 156
  - 157
  - 158
  networkx.algorithms.reciprocity:
  - 1
  - 11
  - 79
  networkx.algorithms.reciprocity._reciprocity_iter:
  - 64
  - 65
  - 66
  - 68
  - 72
  - 73
  - 75
  - 76
  - 62
  - 63
  networkx.algorithms.reciprocity.overall_reciprocity:
  - 82
  - 92
  - 93
  - 95
  networkx.algorithms.reciprocity.reciprocity:
  - 44
  - 45
  - 14
  - 49
  - 50
  - 51
  - 58
  networkx.algorithms.regular:
  - 1
  - 73
  - 74
  - 75
  - 47
  networkx.algorithms.regular.is_k_regular:
  - 50
  - 70
  networkx.algorithms.regular.is_regular:
  - 33
  - 35
  - 36
  - 37
  - 38
  - 40
  - 42
  - 11
  - 44
  networkx.algorithms.regular.k_factor:
  - 128
  - 129
  - 132
  - 133
  - 136
  - 137
  - 138
  - 141
  - 143
  - 144
  - 147
  - 148
  - 154
  - 157
  - 158
  - 159
  - 160
  - 161
  - 162
  - 163
  - 165
  - 77
  - 116
  - 119
  - 123
  - 127
  networkx.algorithms.richclub:
  - 1
  - 11
  - 12
  networkx.algorithms.richclub._compute_rc:
  - 128
  - 130
  - 132
  - 135
  - 104
  - 113
  - 114
  - 117
  - 123
  - 124
  - 125
  networkx.algorithms.richclub.rich_club_coefficient:
  - 96
  - 97
  - 98
  - 99
  - 15
  - 87
  - 91
  - 92
  - 95
  networkx.algorithms.shortest_paths.astar:
  - 1
  - 12
  - 174
  networkx.algorithms.shortest_paths.astar.astar_path:
  - 128
  - 132
  - 134
  - 137
  - 139
  - 14
  - 144
  - 149
  - 150
  - 151
  - 154
  - 160
  - 163
  - 165
  - 169
  - 94
  - 97
  - 100
  - 105
  - 114
  - 115
  - 126
  networkx.algorithms.shortest_paths.astar.astar_path_length:
  - 233
  - 237
  - 238
  - 239
  - 178
  networkx.algorithms.shortest_paths.dense:
  - 1
  - 172
  - 13
  - 216
  - 89
  networkx.algorithms.shortest_paths.dense.floyd_warshall:
  - 264
  - 218
  networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy:
  - 69
  - 70
  - 78
  - 15
  - 82
  - 83
  - 85
  networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance:
  - 160
  - 162
  - 164
  - 166
  - 169
  - 155
  - 146
  - 147
  - 149
  - 152
  - 153
  - 154
  - 91
  - 157
  - 158
  networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.<lambda1>:
  - 146
  networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.<lambda1>.<lambda1>:
  - 146
  networkx.algorithms.shortest_paths.dense.reconstruct_path:
  - 213
  - 212
  - 205
  - 174
  networkx.algorithms.shortest_paths.generic:
  - 1
  - 325
  - 519
  - 42
  - 592
  - 181
  - 441
  networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors:
  - 705
  - 708
  - 710
  - 711
  - 715
  - 653
  - 692
  - 700
  - 701
  - 702
  networkx.algorithms.shortest_paths.generic.all_pairs_all_shortest_paths:
  - 648
  - 594
  - 645
  - 646
  networkx.algorithms.shortest_paths.generic.all_shortest_paths:
  - 512
  - 516
  - 507
  - 443
  - 508
  - 509
  - 510
  - 511
  networkx.algorithms.shortest_paths.generic.average_shortest_path_length:
  - 417
  - 327
  - 397
  - 429
  - 399
  - 431
  - 433
  - 402
  - 434
  - 435
  - 405
  - 436
  - 437
  - 411
  - 414
  networkx.algorithms.shortest_paths.generic.average_shortest_path_length.path_length:
  - 422
  - 423
  - 424
  - 425
  - 426
  - 427
  networkx.algorithms.shortest_paths.generic.has_path:
  - 36
  - 23
  networkx.algorithms.shortest_paths.generic.shortest_path:
  - 135
  - 139
  - 140
  - 142
  - 143
  - 144
  - 145
  - 147
  - 150
  - 151
  - 152
  - 153
  - 154
  - 155
  - 157
  - 159
  - 160
  - 162
  - 164
  - 165
  - 166
  - 167
  - 169
  - 44
  - 172
  - 173
  - 174
  - 175
  - 177
  networkx.algorithms.shortest_paths.generic.shortest_path_length:
  - 276
  - 280
  - 281
  - 283
  - 284
  - 285
  - 286
  - 288
  - 291
  - 292
  - 293
  - 295
  - 296
  - 298
  - 301
  - 303
  - 305
  - 306
  - 307
  - 309
  - 183
  - 312
  - 315
  - 316
  - 317
  - 318
  - 319
  - 321
  networkx.algorithms.shortest_paths.generic.single_source_all_shortest_paths:
  - 580
  - 581
  - 582
  - 583
  - 584
  - 521
  - 585
  - 588
  - 589
  networkx.algorithms.shortest_paths.unweighted:
  - 1
  networkx.algorithms.shortest_paths.unweighted._bidirectional_pred_succ:
  - 320
  - 323
  - 324
  - 293
  - 325
  - 326
  - 328
  - 300
  - 333
  - 334
  - 335
  - 304
  - 337
  - 338
  networkx.algorithms.shortest_paths.unweighted._single_shortest_path:
  - 419
  - 423
  - 424
  - 425
  - 426
  - 427
  - 428
  - 399
  networkx.algorithms.shortest_paths.unweighted._single_shortest_path_length:
  - 96
  - 99
  - 100
  - 101
  - 106
  - 107
  - 108
  - 109
  - 110
  - 111
  - 112
  - 84
  networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path:
  - 536
  - 537
  - 495
  networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length:
  - 177
  - 222
  - 223
  networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path:
  - 228
  - 266
  - 269
  - 273
  - 280
  - 282
  - 286
  networkx.algorithms.shortest_paths.unweighted.predecessor:
  - 608
  - 609
  - 612
  - 613
  - 614
  - 606
  - 618
  - 590
  - 622
  - 601
  - 602
  - 603
  - 542
  - 607
  networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path:
  - 389
  - 391
  - 392
  - 395
  - 346
  networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length:
  - 75
  - 77
  - 78
  - 80
  - 23
  networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path:
  - 485
  - 486
  - 487
  - 490
  - 436
  - 478
  networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length:
  - 165
  - 167
  - 168
  - 170
  - 172
  - 118
  networkx.algorithms.shortest_paths.weighted:
  - 1
  - 2309
  - 392
  - 650
  - 1165
  - 910
  - 1052
  - 2462
  - 1699
  - 1572
  - 2214
  - 1960
  - 175
  - 568
  - 320
  - 1856
  - 81
  - 1111
  - 983
  - 2143
  - 1762
  - 1513
  - 1643
  - 494
  - 1911
  - 255
  networkx.algorithms.shortest_paths.weighted._bellman_ford:
  - 1376
  - 1379
  - 1380
  - 1382
  - 1383
  - 1384
  - 1362
  - 1365
  - 1368
  - 1305
  networkx.algorithms.shortest_paths.weighted._dijkstra:
  - 779
  - 771
  networkx.algorithms.shortest_paths.weighted._dijkstra_multisource:
  - 900
  - 901
  - 903
  - 787
  - 849
  - 851
  - 853
  - 854
  - 856
  - 857
  - 860
  - 862
  - 863
  - 864
  - 867
  - 869
  - 871
  - 873
  - 876
  - 877
  - 879
  - 880
  - 882
  - 885
  - 887
  - 889
  - 893
  networkx.algorithms.shortest_paths.weighted._inner_bellman_ford:
  - 1439
  - 1440
  - 1443
  - 1446
  - 1455
  - 1456
  - 1459
  - 1460
  - 1462
  - 1463
  - 1466
  - 1468
  - 1469
  - 1471
  - 1478
  - 1479
  - 1481
  - 1488
  - 1493
  - 1494
  - 1495
  - 1496
  - 1497
  - 1506
  - 1507
  - 1397
  networkx.algorithms.shortest_paths.weighted._weight_function:
  - 71
  - 42
  - 76
  - 77
  - 78
  networkx.algorithms.shortest_paths.weighted._weight_function.<lambda1>:
  - 77
  networkx.algorithms.shortest_paths.weighted._weight_function.<lambda2>:
  - 78
  networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path:
  - 1913
  - 1956
  - 1957
  networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length:
  - 1858
  - 1907
  - 1908
  networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra:
  - 1048
  - 985
  - 1049
  - 1047
  networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path:
  - 1113
  - 1161
  - 1162
  networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length:
  - 1107
  - 1108
  - 1054
  networkx.algorithms.shortest_paths.weighted.bellman_ford_path:
  - 1568
  - 1515
  networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length:
  - 1633
  - 1635
  - 1574
  - 1628
  - 1629
  networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance:
  - 1284
  - 1287
  - 1289
  - 1169
  - 1268
  - 1270
  - 1271
  - 1272
  - 1273
  - 1274
  - 1278
  networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra:
  - 2434
  - 2437
  - 2311
  - 2439
  - 2441
  - 2442
  - 2445
  - 2446
  - 2448
  - 2451
  - 2453
  - 2457
  - 2387
  - 2390
  - 2393
  - 2396
  - 2410
  - 2412
  - 2413
  - 2415
  - 2428
  - 2429
  networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.path:
  - 2404
  - 2406
  networkx.algorithms.shortest_paths.weighted.dijkstra_path:
  - 83
  - 171
  networkx.algorithms.shortest_paths.weighted.dijkstra_path_length:
  - 177
  - 243
  - 245
  - 247
  - 248
  networkx.algorithms.shortest_paths.weighted.dijkstra_predecessor_and_distance:
  - 912
  - 978
  - 980
  - 976
  networkx.algorithms.shortest_paths.weighted.find_negative_cycle:
  - 2273
  - 2274
  - 2279
  - 2216
  - 2283
  - 2285
  - 2286
  - 2289
  - 2290
  - 2291
  - 2292
  - 2293
  - 2294
  - 2296
  - 2297
  - 2298
  - 2300
  - 2270
  networkx.algorithms.shortest_paths.weighted.goldberg_radzik:
  - 2137
  - 2051
  - 2054
  - 1962
  - 2059
  - 2136
  - 2041
  - 2043
  - 2044
  - 2045
  - 2046
  - 2047
  networkx.algorithms.shortest_paths.weighted.goldberg_radzik.relax:
  - 2117
  - 2118
  - 2121
  - 2123
  - 2124
  - 2125
  - 2128
  networkx.algorithms.shortest_paths.weighted.goldberg_radzik.topo_sort:
  - 2081
  - 2113
  - 2086
  - 2092
  - 2094
  - 2095
  - 2096
  - 2065
  - 2098
  - 2100
  - 2103
  - 2105
  - 2106
  - 2107
  - 2078
  networkx.algorithms.shortest_paths.weighted.johnson:
  - 2464
  - 2530
  - 2542
  - 2527
  networkx.algorithms.shortest_paths.weighted.johnson.dist_path:
  - 2539
  networkx.algorithms.shortest_paths.weighted.johnson.new_weight:
  - 2535
  networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra:
  - 652
  - 750
  - 752
  - 753
  - 755
  - 757
  - 759
  - 762
  networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path:
  - 496
  - 564
  networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length:
  - 641
  - 643
  - 644
  - 646
  - 647
  - 570
  networkx.algorithms.shortest_paths.weighted.negative_edge_cycle:
  - 2145
  - 2210
  - 2193
  - 2201
  - 2204
  networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford:
  - 1764
  - 1838
  - 1839
  - 1843
  - 1846
  - 1847
  networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path:
  - 1645
  - 1695
  networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length:
  - 1701
  - 1758
  - 1759
  networkx.algorithms.shortest_paths.weighted.single_source_dijkstra:
  - 489
  - 394
  networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path:
  - 257
  - 317
  networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length:
  - 322
  - 389
  networkx.algorithms.similarity:
  - 1
  - 386
  - 36
  - 1766
  - 1511
  - 1767
  - 1966
  - 1967
  - 210
  - 537
  - 1628
  - 1629
  networkx.algorithms.similarity._prepare_panther_paths:
  - 1568
  - 1601
  - 1602
  - 1573
  - 1574
  - 1608
  - 1578
  - 1579
  - 1581
  - 1584
  - 1585
  - 1524
  - 1590
  - 1595
  - 1594
  - 1563
  - 1566
  networkx.algorithms.similarity._simrank_similarity_numpy:
  - 1504
  - 1505
  - 1410
  - 1506
  - 1483
  - 1486
  - 1490
  - 1491
  - 1492
  - 1494
  - 1496
  - 1499
  networkx.algorithms.similarity._simrank_similarity_python:
  - 1377
  - 1379
  - 1380
  - 1381
  - 1350
  - 1382
  - 1383
  - 1385
  - 1387
  - 1390
  - 1395
  - 1397
  - 1372
  networkx.algorithms.similarity._simrank_similarity_python.avg_sim:
  - 1370
  networkx.algorithms.similarity._simrank_similarity_python.sim:
  - 1375
  networkx.algorithms.similarity.generate_random_paths:
  - 2052
  - 2055
  - 2056
  - 2059
  - 2060
  - 2062
  - 2063
  - 2065
  - 2068
  - 2072
  - 2079
  - 2080
  - 2081
  - 2086
  - 2089
  - 2098
  - 2101
  - 2102
  - 2103
  - 1978
  - 2107
  - 2047
  networkx.algorithms.similarity.graph_edit_distance:
  - 189
  - 54
  networkx.algorithms.similarity.optimal_edit_paths:
  - 224
  - 379
  - 364
  - 381
  networkx.algorithms.similarity.optimize_edit_paths:
  - 1153
  - 1154
  - 1155
  - 1157
  - 1158
  - 1160
  - 1162
  - 1164
  - 1165
  - 1167
  - 1056
  - 1057
  - 1186
  - 1060
  - 1062
  - 1066
  - 1067
  - 556
  - 1195
  - 1070
  - 1071
  - 1072
  - 1073
  - 1074
  - 1076
  - 1081
  - 1082
  - 1083
  - 1084
  - 1086
  - 1091
  - 1092
  - 1097
  - 1098
  - 1100
  - 1102
  - 1103
  - 1105
  - 1107
  - 1108
  - 1109
  - 1111
  - 1112
  - 1114
  - 1116
  - 1117
  - 1120
  - 1121
  - 1122
  - 1123
  - 1124
  - 1126
  - 1131
  - 1132
  - 1134
  - 1143
  - 1144
  - 1146
  - 1148
  - 1149
  - 1151
  networkx.algorithms.similarity.optimize_edit_paths.extract_C:
  - 720
  - 719
  networkx.algorithms.similarity.optimize_edit_paths.get_edit_ops:
  - 897
  - 900
  - 906
  - 909
  - 910
  - 912
  - 913
  - 918
  - 920
  - 928
  - 930
  - 932
  - 934
  - 936
  - 842
  - 864
  - 865
  - 869
  - 870
  - 872
  - 880
  - 882
  - 886
  - 887
  - 888
  - 889
  - 892
  networkx.algorithms.similarity.optimize_edit_paths.get_edit_paths:
  - 1024
  - 1027
  - 1040
  - 1041
  - 1042
  - 1043
  - 1044
  - 1045
  - 1046
  - 1047
  - 1048
  - 1049
  - 1050
  - 1051
  - 1052
  - 949
  - 974
  - 977
  - 983
  - 984
  - 987
  - 997
  - 1000
  - 1004
  - 1005
  - 1006
  - 1007
  - 1008
  - 1009
  - 1010
  - 1016
  - 1017
  - 1019
  - 1020
  - 1023
  networkx.algorithms.similarity.optimize_edit_paths.make_CostMatrix:
  - 713
  - 714
  - 700
  networkx.algorithms.similarity.optimize_edit_paths.match_edges:
  - 769
  - 771
  - 777
  - 779
  - 784
  - 785
  - 787
  - 788
  - 793
  - 795
  - 797
  - 798
  - 804
  - 809
  - 811
  - 815
  - 821
  - 827
  - 737
  - 753
  - 754
  - 762
  - 763
  networkx.algorithms.similarity.optimize_edit_paths.prune:
  - 1170
  - 1171
  - 1173
  - 1174
  - 1176
  - 1178
  networkx.algorithms.similarity.optimize_edit_paths.reduce_C:
  - 725
  - 726
  networkx.algorithms.similarity.optimize_edit_paths.reduce_Ce:
  - 832
  - 833
  - 834
  - 835
  - 836
  networkx.algorithms.similarity.optimize_edit_paths.reduce_ind:
  - 732
  networkx.algorithms.similarity.optimize_graph_edit_distance:
  - 400
  - 520
  - 534
  networkx.algorithms.similarity.panther_similarity:
  - 1730
  - 1762
  - 1735
  - 1736
  - 1641
  - 1758
  - 1742
  - 1745
  - 1714
  - 1746
  - 1751
  - 1752
  - 1753
  - 1757
  - 1726
  - 1727
  networkx.algorithms.similarity.panther_vector_similarity:
  - 1922
  - 1927
  - 1928
  - 1933
  - 1934
  - 1942
  - 1946
  - 1951
  - 1952
  - 1956
  - 1959
  - 1960
  - 1961
  - 1881
  - 1893
  - 1894
  - 1897
  - 1902
  - 1903
  - 1904
  - 1907
  - 1781
  - 1910
  - 1912
  - 1918
  networkx.algorithms.similarity.simrank_similarity:
  - 1313
  - 1314
  - 1315
  - 1318
  - 1322
  - 1323
  - 1326
  - 1330
  - 1334
  - 1207
  - 1336
  - 1338
  - 1339
  - 1335
  networkx.algorithms.simple_paths:
  - 422
  - 423
  networkx.algorithms.simple_paths.PathBuffer.__init__:
  - 577
  - 575
  networkx.algorithms.simple_paths.PathBuffer.__len__:
  - 580
  networkx.algorithms.simple_paths.PathBuffer.pop:
  - 589
  - 590
  - 591
  networkx.algorithms.simple_paths.PathBuffer.push:
  - 584
  - 585
  - 586
  - 583
  networkx.algorithms.simple_paths._all_simple_edge_paths:
  - 416
  - 419
  - 389
  - 390
  - 391
  - 398
  - 402
  - 403
  - 405
  - 406
  - 411
  - 412
  - 415
  networkx.algorithms.simple_paths._all_simple_edge_paths.<lambda1>:
  - 389
  networkx.algorithms.simple_paths._all_simple_edge_paths.<lambda2>:
  - 391
  networkx.algorithms.simple_paths._bidirectional_dijkstra:
  - 903
  - 904
  - 906
  - 914
  - 916
  - 917
  - 929
  - 930
  - 935
  - 940
  - 941
  - 942
  - 944
  - 945
  - 949
  - 950
  - 952
  - 955
  - 957
  - 961
  - 964
  - 841
  - 843
  - 844
  - 849
  - 857
  - 867
  - 868
  - 871
  - 872
  - 890
  - 891
  - 766
  networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_iter.iterate:
  - 897
  - 898
  - 899
  - 861
  - 862
  - 863
  networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_pred_iter.iterate:
  - 876
  - 877
  - 878
  networkx.algorithms.simple_paths._bidirectional_dijkstra.filter_succ_iter.iterate:
  - 884
  - 885
  - 886
  networkx.algorithms.simple_paths._bidirectional_pred_succ:
  - 659
  - 665
  - 667
  - 671
  - 679
  - 689
  - 690
  - 693
  - 694
  - 712
  - 713
  - 725
  - 726
  - 737
  - 740
  - 741
  - 742
  - 743
  - 745
  - 751
  - 752
  - 753
  - 755
  - 756
  networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_iter.iterate:
  - 683
  - 684
  - 685
  - 719
  - 720
  - 721
  networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_pred_iter.iterate:
  - 698
  - 699
  - 700
  networkx.algorithms.simple_paths._bidirectional_pred_succ.filter_succ_iter.iterate:
  - 706
  - 707
  - 708
  networkx.algorithms.simple_paths._bidirectional_shortest_path:
  - 640
  - 647
  - 652
  - 655
  - 598
  networkx.algorithms.simple_paths.all_simple_edge_paths:
  - 263
  - 363
  - 366
  - 370
  - 374
  - 376
  - 377
  networkx.algorithms.simple_paths.all_simple_paths:
  - 96
  - 257
  - 258
  networkx.algorithms.simple_paths.is_simple_path:
  - 73
  - 78
  - 18
  - 83
  - 87
  - 91
  networkx.algorithms.simple_paths.shortest_simple_paths:
  - 514
  - 517
  - 520
  - 524
  - 534
  - 537
  - 538
  - 539
  - 541
  - 542
  - 543
  - 545
  - 546
  - 547
  - 548
  - 550
  - 425
  - 559
  - 562
  - 564
  - 565
  - 566
  - 567
  networkx.algorithms.simple_paths.shortest_simple_paths.length_func:
  - 528
  - 527
  networkx.algorithms.smallworld:
  - 248
  - 1
  - 122
  - 317
  - 123
  - 315
  - 246
  - 247
  - 24
  - 25
  - 26
  - 27
  - 124
  - 125
  - 316
  networkx.algorithms.smallworld.lattice_reference:
  - 177
  - 179
  - 184
  - 185
  - 186
  - 188
  - 189
  - 190
  - 191
  - 192
  - 193
  - 194
  - 196
  - 197
  - 202
  - 204
  - 209
  - 210
  - 215
  - 216
  - 217
  - 218
  - 220
  - 224
  - 225
  - 227
  - 228
  - 229
  - 230
  - 233
  - 235
  - 236
  - 237
  - 238
  - 127
  networkx.algorithms.smallworld.omega:
  - 320
  - 384
  - 386
  - 387
  - 390
  - 394
  - 395
  - 398
  - 399
  - 400
  - 404
  - 379
  networkx.algorithms.smallworld.random_reference:
  - 29
  - 67
  - 69
  - 76
  - 77
  - 78
  - 79
  - 80
  - 82
  - 85
  - 90
  - 91
  - 96
  - 97
  - 98
  - 102
  - 103
  - 104
  - 105
  - 106
  - 109
  - 111
  - 112
  - 113
  - 114
  networkx.algorithms.smallworld.sigma:
  - 300
  - 301
  - 302
  - 303
  - 305
  - 306
  - 307
  - 308
  - 312
  - 251
  networkx.algorithms.smetric.s_metric:
  - 8
  - 30
  networkx.algorithms.sparsifiers:
  - 1
  - 11
  - 12
  - 13
  - 14
  networkx.algorithms.sparsifiers._add_edge_to_spanner:
  - 273
  - 294
  - 295
  networkx.algorithms.sparsifiers._lightest_edge_dicts:
  - 227
  - 260
  - 263
  networkx.algorithms.sparsifiers._setup_residual_graph:
  - 214
  - 217
  - 218
  - 219
  - 221
  - 191
  networkx.algorithms.sparsifiers.spanner:
  - 132
  - 133
  - 135
  - 139
  - 142
  - 16
  - 146
  - 150
  - 158
  - 159
  - 162
  - 165
  - 166
  - 171
  - 172
  - 173
  - 174
  - 177
  - 178
  - 179
  - 182
  - 183
  - 184
  - 185
  - 67
  - 73
  - 74
  - 79
  - 83
  - 84
  - 89
  - 90
  - 91
  - 92
  - 95
  - 96
  - 98
  - 99
  - 104
  - 108
  - 112
  - 114
  - 115
  - 117
  - 118
  - 121
  - 127
  networkx.algorithms.structuralholes:
  - 1
  - 8
  - 52
  - 217
  - 317
  - 31
  networkx.algorithms.structuralholes.constraint:
  - 288
  - 289
  - 294
  - 297
  - 298
  - 300
  - 304
  - 306
  - 308
  - 277
  - 309
  - 311
  - 312
  - 282
  - 219
  networkx.algorithms.structuralholes.effective_size:
  - 161
  - 166
  - 170
  - 172
  - 174
  - 177
  - 180
  - 181
  - 54
  - 184
  - 186
  - 188
  - 192
  - 195
  - 196
  - 199
  - 200
  - 202
  - 203
  - 205
  - 208
  - 209
  - 211
  - 212
  networkx.algorithms.structuralholes.effective_size.redundancy:
  - 144
  - 145
  - 143
  networkx.algorithms.structuralholes.local_constraint:
  - 369
  - 370
  - 371
  - 372
  - 319
  networkx.algorithms.structuralholes.mutual_weight:
  - 25
  - 10
  - 21
  networkx.algorithms.structuralholes.normalized_mutual_weight:
  - 48
  - 33
  - 49
  networkx.algorithms.summarization:
  - 408
  - 1
  - 69
  networkx.algorithms.summarization._snap_build_graph:
  - 263
  - 265
  - 270
  - 273
  - 275
  - 278
  - 279
  - 281
  - 286
  - 290
  - 291
  - 292
  - 293
  - 294
  - 295
  - 296
  - 297
  - 298
  - 299
  - 302
  - 228
  networkx.algorithms.summarization._snap_eligible_group:
  - 330
  - 331
  - 335
  - 336
  - 337
  - 338
  - 308
  - 345
  - 346
  - 347
  - 348
  - 349
  - 351
  networkx.algorithms.summarization._snap_split:
  - 387
  - 388
  - 389
  - 390
  - 360
  - 392
  - 395
  - 396
  - 399
  - 402
  networkx.algorithms.summarization.dedensify:
  - 174
  - 177
  - 180
  - 183
  - 184
  - 185
  - 186
  - 187
  - 191
  - 192
  - 194
  - 195
  - 196
  - 197
  - 71
  - 200
  - 202
  - 203
  - 204
  - 205
  - 206
  - 207
  - 208
  - 210
  - 211
  - 212
  - 213
  networkx.algorithms.summarization.snap_aggregation:
  - 544
  - 546
  - 419
  - 550
  - 551
  - 554
  - 526
  - 527
  - 529
  - 530
  - 532
  - 535
  - 536
  - 539
  - 540
  - 542
  - 543
  networkx.algorithms.swap:
  - 1
  - 134
  - 135
  - 232
  - 233
  - 11
  - 12
  - 13
  networkx.algorithms.swap.connected_double_edge_swap:
  - 384
  - 385
  - 386
  - 387
  - 388
  - 393
  - 399
  - 400
  - 401
  - 402
  - 403
  - 405
  - 302
  - 304
  - 308
  - 310
  - 311
  - 320
  - 326
  - 328
  - 334
  - 335
  - 337
  - 339
  - 340
  - 341
  - 342
  - 343
  - 344
  - 348
  - 352
  - 353
  - 354
  - 355
  - 359
  - 360
  - 235
  - 370
  - 372
  - 378
  - 379
  - 381
  - 383
  networkx.algorithms.swap.directed_edge_swap:
  - 128
  - 15
  - 72
  - 74
  - 76
  - 84
  - 85
  - 90
  - 94
  - 99
  - 101
  - 102
  - 105
  - 107
  - 108
  - 111
  - 113
  - 114
  - 117
  - 123
  - 124
  - 125
  - 126
  - 127
  networkx.algorithms.swap.double_edge_swap:
  - 192
  - 199
  - 200
  - 137
  - 206
  - 207
  - 220
  - 212
  - 213
  - 214
  - 184
  - 217
  - 218
  - 219
  - 188
  - 222
  - 190
  - 216
  networkx.algorithms.threshold:
  - 1
  - 372
  - 825
  - 305
  networkx.algorithms.threshold.betweenness_sequence:
  - 673
  - 677
  - 678
  - 685
  - 697
  - 692
  - 696
  - 665
  networkx.algorithms.threshold.cluster_sequence:
  - 489
  - 492
  - 493
  - 495
  - 497
  - 498
  - 501
  networkx.algorithms.threshold.creation_sequence:
  - 96
  - 100
  - 101
  - 69
  - 103
  - 104
  - 107
  - 108
  - 109
  - 110
  - 112
  - 114
  - 116
  - 117
  - 120
  - 122
  - 123
  networkx.algorithms.threshold.creation_sequence_to_weights:
  - 226
  - 227
  - 196
  - 228
  - 231
  - 235
  - 204
  - 205
  - 208
  - 209
  - 211
  - 212
  - 216
  - 219
  - 220
  - 223
  networkx.algorithms.threshold.degree_correlation:
  - 544
  - 545
  - 546
  - 547
  - 548
  - 550
  - 558
  - 559
  - 535
  - 543
  networkx.algorithms.threshold.degree_sequence:
  - 512
  - 513
  - 514
  - 516
  - 518
  - 506
  networkx.algorithms.threshold.density:
  - 528
  - 523
  - 527
  networkx.algorithms.threshold.eigenvalues:
  - 803
  - 804
  - 807
  - 808
  - 810
  - 811
  - 815
  - 784
  - 816
  networkx.algorithms.threshold.eigenvectors:
  - 705
  - 737
  - 739
  - 740
  - 744
  - 716
  - 717
  - 721
  - 754
  - 724
  - 732
  networkx.algorithms.threshold.find_alternating_4_cycle:
  - 358
  - 363
  - 364
  - 365
  - 366
  - 367
  networkx.algorithms.threshold.find_creation_sequence:
  - 416
  - 418
  - 419
  - 420
  - 422
  - 423
  - 427
  - 428
  - 430
  - 432
  - 434
  - 435
  - 409
  networkx.algorithms.threshold.find_threshold_graph:
  - 404
  - 374
  networkx.algorithms.threshold.is_threshold_graph:
  - 42
  - 15
  networkx.algorithms.threshold.is_threshold_sequence:
  - 46
  - 56
  - 58
  - 59
  - 61
  - 63
  networkx.algorithms.threshold.left_d_threshold_sequence:
  - 968
  - 963
  - 916
  - 979
  networkx.algorithms.threshold.make_compact:
  - 128
  - 161
  - 162
  - 165
  - 167
  - 150
  - 152
  - 154
  networkx.algorithms.threshold.random_threshold_sequence:
  - 845
  - 849
  - 850
  - 851
  - 853
  - 827
  networkx.algorithms.threshold.right_d_threshold_sequence:
  - 900
  - 861
  - 895
  networkx.algorithms.threshold.shortest_path:
  - 611
  - 612
  - 584
  - 585
  - 586
  - 588
  - 589
  - 590
  - 595
  - 597
  - 566
  - 600
  - 603
  - 604
  - 605
  - 606
  networkx.algorithms.threshold.shortest_path_length:
  - 640
  - 641
  - 646
  - 650
  - 619
  - 651
  - 653
  - 654
  - 657
  - 658
  - 632
  - 633
  - 636
  - 637
  - 639
  networkx.algorithms.threshold.spectral_projection:
  - 779
  - 777
  - 778
  - 763
  networkx.algorithms.threshold.threshold_graph:
  - 352
  - 324
  - 325
  - 326
  - 328
  - 329
  - 330
  - 334
  - 335
  - 307
  - 344
  - 345
  - 350
  - 351
  networkx.algorithms.threshold.triangle_sequence:
  - 483
  - 461
  - 467
  - 471
  - 472
  - 476
  networkx.algorithms.threshold.triangles:
  - 448
  - 441
  - 452
  - 453
  networkx.algorithms.threshold.uncompact:
  - 172
  - 179
  - 181
  - 183
  - 189
  - 190
  - 191
  networkx.algorithms.threshold.weights_to_creation_sequence:
  - 288
  - 289
  - 291
  - 292
  - 293
  - 295
  - 297
  - 299
  - 300
  - 272
  - 276
  - 277
  - 245
  - 279
  - 280
  - 284
  - 285
  - 286
  networkx.algorithms.time_dependent:
  - 1
  - 10
  - 11
  - 9
  networkx.algorithms.time_dependent.cd_index:
  - 128
  - 131
  - 132
  - 136
  - 137
  - 13
  - 141
  - 142
  - 113
  networkx.algorithms.tournament:
  - 352
  - 1
  - 353
  - 67
  - 68
  - 262
  - 263
  - 106
  - 107
  - 219
  - 220
  - 221
  - 154
  - 155
  - 188
  - 189
  - 351
  networkx.algorithms.tournament.hamiltonian_path:
  - 141
  - 110
  - 143
  - 144
  - 145
  - 146
  - 149
  - 150
  networkx.algorithms.tournament.index_satisfying:
  - 41
  - 53
  - 54
  networkx.algorithms.tournament.is_reachable:
  - 266
  - 347
  - 348
  networkx.algorithms.tournament.is_reachable.is_closed:
  - 345
  - 338
  networkx.algorithms.tournament.is_reachable.two_neighborhood:
  - 321
  - 333
  - 334
  networkx.algorithms.tournament.is_strongly_connected:
  - 355
  - 406
  networkx.algorithms.tournament.is_tournament:
  - 101
  - 102
  - 71
  networkx.algorithms.tournament.random_tournament:
  - 182
  - 183
  - 184
  - 185
  - 157
  networkx.algorithms.tournament.score_sequence:
  - 192
  - 216
  networkx.algorithms.tournament.tournament_matrix:
  - 258
  - 223
  networkx.algorithms.traversal.beamsearch:
  - 1
  networkx.algorithms.traversal.beamsearch.bfs_beam_edges:
  - 65
  - 10
  - 90
  - 66
  networkx.algorithms.traversal.beamsearch.bfs_beam_edges.successors:
  - 88
  - 69
  networkx.algorithms.traversal.breadth_first_search:
  - 1
  - 197
  networkx.algorithms.traversal.breadth_first_search.bfs_edges:
  - 194
  - 110
  - 184
  - 189
  - 190
  - 191
  networkx.algorithms.traversal.breadth_first_search.bfs_edges.<lambda1>:
  - 191
  networkx.algorithms.traversal.breadth_first_search.bfs_labeled_edges:
  - 535
  - 517
  - 521
  - 522
  - 523
  - 525
  - 526
  - 529
  - 466
  - 530
  - 531
  - 532
  - 533
  - 534
  - 536
  - 505
  - 509
  - 510
  networkx.algorithms.traversal.breadth_first_search.bfs_layers:
  - 407
  - 448
  - 450
  - 451
  - 452
  - 453
  - 454
  - 435
  - 438
  - 439
  - 441
  - 442
  networkx.algorithms.traversal.breadth_first_search.bfs_predecessors:
  - 328
  - 267
  - 325
  networkx.algorithms.traversal.breadth_first_search.bfs_successors:
  - 393
  - 396
  - 333
  - 397
  - 399
  - 402
  networkx.algorithms.traversal.breadth_first_search.bfs_tree:
  - 261
  - 199
  - 252
  - 253
  - 254
  networkx.algorithms.traversal.breadth_first_search.descendants_at_distance:
  - 576
  - 541
  - 569
  - 572
  - 573
  - 574
  - 575
  networkx.algorithms.traversal.breadth_first_search.generic_bfs_edges:
  - 97
  - 98
  - 99
  - 100
  - 101
  - 102
  - 103
  - 85
  - 21
  - 87
  - 88
  - 91
  - 93
  networkx.algorithms.traversal.depth_first_search:
  - 1
  - 115
  networkx.algorithms.traversal.depth_first_search.dfs_edges:
  - 97
  - 98
  - 102
  - 103
  - 104
  - 105
  - 106
  - 107
  - 78
  - 20
  - 85
  - 84
  - 90
  - 93
  - 94
  - 95
  networkx.algorithms.traversal.depth_first_search.dfs_edges.<lambda1>:
  - 90
  networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges:
  - 512
  - 513
  - 514
  - 516
  - 517
  - 518
  - 519
  - 523
  - 529
  - 415
  - 487
  - 493
  - 494
  - 499
  - 502
  - 503
  - 504
  - 506
  - 507
  - 508
  networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.<lambda1>:
  - 499
  networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes:
  - 297
  - 348
  networkx.algorithms.traversal.depth_first_search.dfs_predecessors:
  - 168
  - 224
  networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes:
  - 356
  - 407
  networkx.algorithms.traversal.depth_first_search.dfs_successors:
  - 291
  - 292
  - 230
  - 284
  - 285
  networkx.algorithms.traversal.depth_first_search.dfs_tree:
  - 161
  - 162
  - 117
  - 157
  - 158
  - 159
  networkx.algorithms.traversal.edgebfs:
  - 1
  networkx.algorithms.traversal.edgebfs.edge_bfs:
  - 130
  - 136
  - 142
  - 22
  - 153
  - 169
  - 170
  - 171
  - 173
  - 174
  - 175
  - 179
  - 180
  - 181
  - 182
  - 183
  - 184
  - 185
  - 115
  - 116
  - 119
  - 121
  - 125
  networkx.algorithms.traversal.edgebfs.edge_bfs.edge_id:
  - 164
  networkx.algorithms.traversal.edgebfs.edge_bfs.edges_from:
  - 128
  - 133
  - 134
  - 139
  - 140
  - 145
  - 146
  - 147
  - 148
  networkx.algorithms.traversal.edgedfs:
  - 1
  networkx.algorithms.traversal.edgedfs.edge_dfs:
  - 128
  - 140
  - 20
  - 155
  - 156
  - 160
  - 164
  - 165
  - 166
  - 169
  - 172
  - 174
  - 175
  - 176
  - 178
  - 179
  - 181
  - 182
  - 101
  - 102
  - 105
  - 107
  - 111
  - 116
  - 122
  networkx.algorithms.traversal.edgedfs.edge_dfs.edge_id:
  - 150
  networkx.algorithms.traversal.edgedfs.edge_dfs.edges_from:
  - 131
  - 132
  - 133
  - 134
  - 114
  - 119
  - 120
  - 125
  - 126
  networkx.algorithms.tree.branchings:
  - 1
  - 804
  - 744
  - 617
  - 638
  - 75
  - 702
  - 109
  - 110
  - 812
  - 816
  - 59
  - 190
  - 62
  - 799
  networkx.algorithms.tree.branchings.ArborescenceIterator:
  - 822
  networkx.algorithms.tree.branchings.ArborescenceIterator.Partition:
  - 851
  - 844
  networkx.algorithms.tree.branchings.ArborescenceIterator.Partition.__copy__:
  - 854
  - 855
  networkx.algorithms.tree.branchings.ArborescenceIterator.__init__:
  - 897
  - 859
  - 881
  - 891
  - 893
  - 895
  networkx.algorithms.tree.branchings.ArborescenceIterator.__iter__:
  - 902
  - 908
  - 909
  - 912
  - 913
  - 915
  - 922
  - 923
  networkx.algorithms.tree.branchings.ArborescenceIterator.__next__:
  - 936
  - 943
  - 947
  - 948
  - 949
  - 955
  - 957
  networkx.algorithms.tree.branchings.ArborescenceIterator._clear_partition:
  - 1040
  - 1042
  - 1036
  - 1039
  networkx.algorithms.tree.branchings.ArborescenceIterator._partition:
  - 992
  - 961
  - 994
  - 998
  - 974
  - 975
  - 976
  - 978
  - 983
  - 985
  networkx.algorithms.tree.branchings.ArborescenceIterator._write_partition:
  - 1024
  - 1026
  - 1030
  - 1031
  - 1032
  - 1001
  - 1013
  - 1014
  - 1018
  - 1020
  - 1023
  networkx.algorithms.tree.branchings.branching_weight:
  - 106
  - 77
  networkx.algorithms.tree.branchings.greedy_branching:
  - 160
  - 164
  - 167
  - 168
  - 171
  - 172
  - 173
  - 112
  - 144
  - 176
  - 147
  - 182
  - 152
  - 185
  - 154
  - 156
  - 184
  networkx.algorithms.tree.branchings.maximum_branching:
  - 512
  - 513
  - 517
  - 523
  - 268
  - 524
  - 526
  - 528
  - 274
  - 275
  - 277
  - 278
  - 280
  - 281
  - 282
  - 538
  - 539
  - 285
  - 540
  - 552
  - 299
  - 555
  - 303
  - 304
  - 566
  - 568
  - 569
  - 571
  - 573
  - 577
  - 589
  - 591
  - 596
  - 598
  - 599
  - 603
  - 604
  - 605
  - 608
  - 484
  - 487
  - 492
  - 493
  - 494
  - 496
  - 497
  - 498
  - 499
  - 508
  - 511
  networkx.algorithms.tree.branchings.maximum_branching.edmonds_add_edge:
  - 232
  - 203
  - 229
  - 227
  networkx.algorithms.tree.branchings.maximum_branching.edmonds_find_desired_edge:
  - 352
  - 354
  - 360
  - 366
  - 336
  networkx.algorithms.tree.branchings.maximum_branching.edmonds_remove_node:
  - 257
  - 236
  - 248
  - 249
  - 250
  - 251
  - 252
  - 254
  networkx.algorithms.tree.branchings.maximum_branching.edmonds_step_I2:
  - 390
  - 392
  - 394
  - 401
  - 407
  - 409
  - 413
  - 414
  - 415
  - 416
  - 419
  - 420
  - 422
  - 423
  - 424
  - 431
  - 432
  - 434
  - 439
  - 441
  - 446
  - 447
  - 448
  - 450
  - 452
  - 453
  - 454
  - 456
  - 457
  - 373
  networkx.algorithms.tree.branchings.maximum_branching.is_root:
  - 460
  - 474
  - 477
  - 478
  - 479
  networkx.algorithms.tree.branchings.maximum_spanning_arborescence:
  - 736
  - 738
  - 718
  - 719
  - 721
  - 724
  - 725
  - 726
  - 728
  - 730
  - 731
  - 732
  - 734
  - 735
  networkx.algorithms.tree.branchings.minimal_branching:
  - 674
  - 642
  - 675
  - 677
  - 680
  - 685
  - 686
  - 688
  - 691
  - 692
  - 693
  - 695
  - 696
  - 697
  networkx.algorithms.tree.branchings.minimum_branching:
  - 621
  - 622
  - 623
  - 625
  - 627
  - 628
  - 629
  - 631
  - 632
  - 633
  networkx.algorithms.tree.branchings.minimum_spanning_arborescence:
  - 748
  - 756
  networkx.algorithms.tree.branchings.random_string:
  - 64
  networkx.algorithms.tree.coding:
  - 1
  - 35
  - 36
  - 132
  - 216
  - 217
  - 318
  networkx.algorithms.tree.coding.NotATree:
  - 28
  networkx.algorithms.tree.coding.from_nested_tuple:
  - 134
  - 204
  - 205
  - 208
  - 209
  - 212
  networkx.algorithms.tree.coding.from_nested_tuple._make_tree:
  - 184
  - 195
  - 196
  - 200
  networkx.algorithms.tree.coding.from_prufer_sequence:
  - 320
  - 385
  - 389
  - 390
  - 394
  - 395
  - 396
  - 398
  - 402
  - 403
  - 405
  - 408
  - 410
  - 412
  networkx.algorithms.tree.coding.to_nested_tuple:
  - 129
  - 126
  - 124
  - 38
  networkx.algorithms.tree.coding.to_nested_tuple._make_tuple:
  - 104
  - 115
  - 116
  - 118
  - 119
  - 120
  - 121
  networkx.algorithms.tree.coding.to_prufer_sequence:
  - 291
  - 292
  - 295
  - 297
  - 300
  - 305
  - 307
  - 308
  - 309
  - 311
  - 314
  - 219
  networkx.algorithms.tree.coding.to_prufer_sequence.parents:
  - 303
  networkx.algorithms.tree.decomposition:
  - 1
  - 12
  - 13
  networkx.algorithms.tree.decomposition.junction_tree:
  - 15
  - 64
  - 66
  - 67
  - 68
  - 70
  - 71
  - 73
  - 74
  - 75
  - 76
  - 77
  - 78
  - 80
  - 82
  - 83
  - 84
  - 85
  - 86
  networkx.algorithms.tree.distance_measures:
  - 1
  - 13
  - 135
  networkx.algorithms.tree.distance_measures._subtree_sizes:
  - 128
  - 130
  - 91
  - 124
  - 126
  networkx.algorithms.tree.distance_measures.center:
  - 66
  - 67
  - 68
  - 70
  - 71
  - 74
  - 75
  - 76
  - 15
  - 80
  - 82
  - 87
  - 62
  - 63
  networkx.algorithms.tree.distance_measures.centroid:
  - 201
  - 138
  - 203
  - 204
  - 205
  - 212
  - 213
  - 215
  - 218
  networkx.algorithms.tree.distance_measures.centroid._heaviest_child:
  - 208
  - 209
  networkx.algorithms.tree.mst:
  - 256
  - 1
  - 1152
  - 745
  - 618
  - 682
  - 746
  - 45
  - 46
  - 143
  - 464
  - 369
  - 370
  - 465
  - 558
  networkx.algorithms.tree.mst.EdgePartition:
  - 31
  networkx.algorithms.tree.mst.SpanningTreeIterator:
  - 975
  networkx.algorithms.tree.mst.SpanningTreeIterator.Partition:
  - 1002
  - 996
  networkx.algorithms.tree.mst.SpanningTreeIterator.Partition.__copy__:
  - 1005
  - 1006
  networkx.algorithms.tree.mst.SpanningTreeIterator.__init__:
  - 1010
  - 1029
  networkx.algorithms.tree.mst.SpanningTreeIterator.__iter__:
  - 1040
  - 1046
  - 1047
  - 1048
  - 1052
  - 1053
  networkx.algorithms.tree.mst.SpanningTreeIterator.__next__:
  - 1059
  - 1066
  - 1070
  - 1071
  - 1072
  - 1075
  - 1077
  networkx.algorithms.tree.mst.SpanningTreeIterator._clear_partition:
  - 1148
  - 1145
  - 1147
  - 1140
  networkx.algorithms.tree.mst.SpanningTreeIterator._partition:
  - 1094
  - 1095
  - 1096
  - 1098
  - 1103
  - 1104
  - 1111
  - 1112
  - 1081
  - 1114
  - 1115
  networkx.algorithms.tree.mst.SpanningTreeIterator._write_partition:
  - 1136
  - 1137
  - 1134
  - 1118
  networkx.algorithms.tree.mst.boruvka_mst_edges:
  - 134
  - 135
  - 136
  - 137
  - 107
  - 139
  - 140
  - 81
  - 50
  - 127
  networkx.algorithms.tree.mst.boruvka_mst_edges.best_edge:
  - 96
  - 100
  - 84
  - 91
  - 93
  - 94
  - 95
  networkx.algorithms.tree.mst.kruskal_mst_edges:
  - 149
  - 189
  - 190
  - 191
  - 193
  - 195
  - 205
  - 207
  - 208
  - 209
  - 214
  - 215
  - 216
  - 219
  - 221
  - 222
  - 224
  - 227
  - 232
  - 233
  - 234
  - 235
  - 236
  - 237
  - 239
  - 241
  - 242
  - 244
  - 245
  - 247
  - 248
  - 249
  - 250
  - 252
  - 253
  networkx.algorithms.tree.mst.maximum_spanning_edges:
  - 553
  - 469
  networkx.algorithms.tree.mst.maximum_spanning_tree:
  - 737
  - 738
  - 739
  - 740
  - 741
  - 684
  - 734
  networkx.algorithms.tree.mst.minimum_spanning_edges:
  - 459
  - 374
  networkx.algorithms.tree.mst.minimum_spanning_tree:
  - 608
  - 611
  - 612
  - 613
  - 614
  - 560
  networkx.algorithms.tree.mst.number_of_spanning_trees:
  - 1154
  - 1283
  - 1258
  - 1262
  - 1263
  - 1265
  - 1266
  - 1269
  - 1271
  - 1273
  - 1278
  - 1279
  networkx.algorithms.tree.mst.partition_spanning_tree:
  - 675
  - 676
  - 677
  - 678
  - 622
  - 666
  networkx.algorithms.tree.mst.prim_mst_edges:
  - 258
  - 285
  - 287
  - 288
  - 293
  - 296
  - 297
  - 298
  - 299
  - 300
  - 301
  - 305
  - 307
  - 308
  - 309
  - 310
  - 314
  - 316
  - 317
  - 319
  - 320
  - 323
  - 324
  - 325
  - 327
  - 329
  - 330
  - 332
  - 334
  - 335
  - 336
  - 337
  - 338
  - 340
  - 341
  - 342
  - 343
  - 347
  - 349
  - 350
  - 352
  - 353
  - 354
  - 358
  networkx.algorithms.tree.mst.random_spanning_tree:
  - 918
  - 920
  - 922
  - 924
  - 925
  - 926
  - 928
  - 930
  - 931
  - 937
  - 940
  - 941
  - 944
  - 945
  - 948
  - 952
  - 958
  - 959
  - 961
  - 965
  - 967
  - 968
  - 969
  - 748
  networkx.algorithms.tree.mst.random_spanning_tree.find_node:
  - 792
  - 816
  - 819
  networkx.algorithms.tree.mst.random_spanning_tree.prepare_graph:
  - 836
  - 839
  - 840
  - 856
  - 855
  - 824
  - 857
  - 859
  - 861
  networkx.algorithms.tree.mst.random_spanning_tree.spanning_tree_total_weight:
  - 898
  - 867
  - 899
  - 911
  - 912
  - 913
  - 891
  - 892
  networkx.algorithms.tree.operations:
  - 1
  - 12
  networkx.algorithms.tree.operations.join_trees:
  - 98
  - 99
  - 71
  - 72
  - 103
  - 104
  - 75
  - 78
  - 14
  - 80
  - 81
  - 84
  - 85
  - 86
  - 89
  - 93
  - 94
  networkx.algorithms.tree.recognition:
  - 81
  - 1
  - 121
  networkx.algorithms.tree.recognition.is_arborescence:
  - 84
  - 118
  networkx.algorithms.tree.recognition.is_branching:
  - 124
  - 158
  networkx.algorithms.tree.recognition.is_forest:
  - 163
  - 207
  - 210
  - 211
  - 213
  - 215
  networkx.algorithms.tree.recognition.is_tree:
  - 264
  - 273
  - 267
  - 220
  networkx.algorithms.triads:
  - 129
  - 5
  - 114
  - 405
  - 342
  - 311
  - 312
  networkx.algorithms.triads._tricode:
  - 126
  - 118
  networkx.algorithms.triads.all_triads:
  - 337
  - 314
  - 339
  - 338
  networkx.algorithms.triads.is_triad:
  - 304
  - 305
  - 306
  - 283
  networkx.algorithms.triads.triad_type:
  - 408
  - 456
  - 458
  - 459
  - 461
  - 463
  - 464
  - 465
  - 467
  - 469
  - 471
  - 473
  - 474
  - 475
  - 476
  - 480
  - 481
  - 485
  - 486
  - 487
  - 489
  - 491
  - 493
  - 495
  - 497
  - 499
  networkx.algorithms.triads.triadic_census:
  - 258
  - 132
  - 260
  - 261
  - 263
  - 264
  - 266
  - 276
  - 201
  - 202
  - 205
  - 206
  - 209
  - 210
  - 213
  - 218
  - 219
  - 221
  - 222
  - 224
  - 226
  - 232
  - 235
  - 238
  - 239
  - 244
  - 245
  - 246
  - 250
  - 251
  - 253
  networkx.algorithms.triads.triads_by_type:
  - 397
  - 398
  - 399
  - 400
  - 401
  - 345
  networkx.algorithms.vitality:
  - 1
  - 12
  networkx.algorithms.vitality.closeness_vitality:
  - 70
  - 71
  - 72
  - 73
  - 75
  - 76
  - 14
  networkx.algorithms.voronoi:
  - 1
  - 9
  networkx.algorithms.voronoi.voronoi_cells:
  - 11
  - 76
  - 78
  - 81
  - 83
  - 84
  networkx.algorithms.walks:
  - 1
  networkx.algorithms.walks.number_of_walks:
  - 68
  - 71
  - 72
  - 10
  - 74
  - 75
  networkx.algorithms.wiener:
  - 96
  - 1
  - 97
  - 163
  - 164
  - 165
  - 229
  - 230
  - 231
  - 25
  - 95
  networkx.algorithms.wiener.gutman_index:
  - 224
  - 225
  - 226
  - 167
  - 221
  - 222
  networkx.algorithms.wiener.hyper_wiener_index:
  - 233
  - 273
  - 274
  - 276
  - 277
  networkx.algorithms.wiener.schultz_index:
  - 160
  - 99
  - 155
  - 156
  - 158
  - 159
  networkx.algorithms.wiener.wiener_index:
  - 85
  - 86
  - 87
  - 89
  - 90
  - 27
  - 92
  networkx.classes.coreviews:
  - 1
  networkx.classes.coreviews.AdjacencyView:
  - 67
  networkx.classes.coreviews.AdjacencyView.__getitem__:
  - 82
  networkx.classes.coreviews.AdjacencyView.copy:
  - 85
  networkx.classes.coreviews.AtlasView:
  - 24
  networkx.classes.coreviews.AtlasView.__iter__:
  - 51
  networkx.classes.coreviews.AtlasView.__len__:
  - 48
  networkx.classes.coreviews.AtlasView.__str__:
  - 60
  networkx.classes.coreviews.AtlasView.copy:
  - 57
  networkx.classes.coreviews.FilterAdjacency:
  - 315
  networkx.classes.coreviews.FilterAdjacency.__getitem__:
  - 352
  - 357
  networkx.classes.coreviews.FilterAdjacency.__getitem__.new_node_ok:
  - 355
  networkx.classes.coreviews.FilterAdjacency.__iter__:
  - 344
  - 347
  - 349
  networkx.classes.coreviews.FilterAdjacency.__len__:
  - 336
  - 338
  - 339
  - 340
  networkx.classes.coreviews.FilterAdjacency.__str__:
  - 361
  networkx.classes.coreviews.FilterAtlas:
  - 268
  networkx.classes.coreviews.FilterAtlas.__getitem__:
  - 303
  networkx.classes.coreviews.FilterAtlas.__iter__:
  - 298
  - 300
  - 295
  networkx.classes.coreviews.FilterAtlas.__len__:
  - 289
  - 290
  - 291
  - 287
  networkx.classes.coreviews.FilterAtlas.__str__:
  - 308
  networkx.classes.coreviews.FilterMultiAdjacency:
  - 414
  networkx.classes.coreviews.FilterMultiAdjacency.__getitem__:
  - 434
  - 429
  networkx.classes.coreviews.FilterMultiAdjacency.__getitem__.edge_ok:
  - 432
  networkx.classes.coreviews.FilterMultiInner:
  - 369
  networkx.classes.coreviews.FilterMultiInner.__getitem__:
  - 400
  - 409
  - 402
  - 403
  networkx.classes.coreviews.FilterMultiInner.__getitem__.new_node_ok:
  - 407
  networkx.classes.coreviews.FilterMultiInner.__iter__:
  - 386
  - 389
  - 390
  - 392
  - 393
  - 396
  - 397
  - 383
  networkx.classes.coreviews.MultiAdjacencyView:
  - 89
  networkx.classes.coreviews.MultiAdjacencyView.__getitem__:
  - 104
  networkx.classes.coreviews.MultiAdjacencyView.copy:
  - 107
  networkx.classes.coreviews.UnionAdjacency:
  - 166
  networkx.classes.coreviews.UnionAdjacency.__getitem__:
  - 205
  networkx.classes.coreviews.UnionAdjacency.__init__:
  - 194
  networkx.classes.coreviews.UnionAdjacency.__iter__:
  - 202
  networkx.classes.coreviews.UnionAdjacency.__len__:
  - 199
  networkx.classes.coreviews.UnionAdjacency.__str__:
  - 211
  networkx.classes.coreviews.UnionAdjacency.copy:
  - 208
  networkx.classes.coreviews.UnionAtlas:
  - 111
  networkx.classes.coreviews.UnionAtlas.__iter__:
  - 141
  networkx.classes.coreviews.UnionAtlas.__len__:
  - 138
  networkx.classes.coreviews.UnionAtlas.__str__:
  - 159
  networkx.classes.coreviews.UnionAtlas.copy:
  - 150
  - 151
  - 152
  - 153
  - 155
  networkx.classes.coreviews.UnionMultiAdjacency:
  - 249
  networkx.classes.coreviews.UnionMultiAdjacency.__getitem__:
  - 264
  networkx.classes.coreviews.UnionMultiInner:
  - 218
  networkx.classes.coreviews.UnionMultiInner.__getitem__:
  - 237
  - 238
  - 239
  - 240
  - 241
  networkx.classes.coreviews.UnionMultiInner.copy:
  - 244
  - 245
  networkx.classes.digraph:
  - 1
  networkx.classes.digraph.DiGraph:
  - 89
  - 330
  - 332
  - 340
  networkx.classes.digraph.DiGraph.__init__:
  - 388
  - 389
  - 391
  - 392
  - 377
  - 345
  - 378
  - 382
  - 383
  networkx.classes.digraph.DiGraph.__new__:
  - 342
  networkx.classes.digraph.DiGraph.add_edge:
  - 736
  - 738
  - 739
  - 740
  - 678
  - 742
  - 743
  - 746
  - 729
  - 730
  - 732
  - 733
  - 734
  - 735
  networkx.classes.digraph.DiGraph.add_edges_from:
  - 803
  - 804
  - 805
  - 807
  - 812
  - 813
  - 815
  - 816
  - 817
  - 818
  - 819
  - 821
  - 822
  - 823
  - 824
  - 825
  - 826
  - 829
  - 749
  networkx.classes.digraph.DiGraph.add_node:
  - 451
  - 489
  - 490
  - 492
  - 493
  - 494
  - 495
  - 497
  - 498
  networkx.classes.digraph.DiGraph.add_nodes_from:
  - 576
  - 577
  - 561
  - 501
  - 568
  - 569
  - 570
  - 571
  - 573
  - 574
  - 575
  networkx.classes.digraph.DiGraph.adj:
  - 411
  - 396
  networkx.classes.digraph.DiGraph.clear:
  - 1218
  - 1232
  - 1233
  - 1234
  - 1235
  - 1236
  networkx.classes.digraph.DiGraph.clear_edges:
  - 1251
  - 1252
  - 1253
  - 1254
  - 1255
  - 1239
  networkx.classes.digraph.DiGraph.degree:
  - 1081
  - 1121
  networkx.classes.digraph.DiGraph.edges:
  - 971
  - 1030
  networkx.classes.digraph.DiGraph.has_predecessor:
  - 906
  networkx.classes.digraph.DiGraph.has_successor:
  - 899
  networkx.classes.digraph.DiGraph.in_degree:
  - 1168
  - 1125
  networkx.classes.digraph.DiGraph.in_edges:
  - 1041
  - 1077
  networkx.classes.digraph.DiGraph.is_directed:
  - 1262
  networkx.classes.digraph.DiGraph.is_multigraph:
  - 1258
  networkx.classes.digraph.DiGraph.out_degree:
  - 1172
  - 1215
  networkx.classes.digraph.DiGraph.out_edges:
  - 1035
  networkx.classes.digraph.DiGraph.pred:
  - 448
  - 436
  networkx.classes.digraph.DiGraph.predecessors:
  - 945
  - 965
  networkx.classes.digraph.DiGraph.remove_edge:
  - 832
  - 863
  networkx.classes.digraph.DiGraph.remove_edges_from:
  - 896
  - 866
  - 891
  - 893
  networkx.classes.digraph.DiGraph.remove_node:
  - 620
  - 617
  - 580
  - 614
  networkx.classes.digraph.DiGraph.remove_nodes_from:
  - 675
  - 623
  - 663
  - 667
  - 670
  networkx.classes.digraph.DiGraph.reverse:
  - 1345
  - 1357
  - 1358
  - 1359
  - 1360
  - 1361
  - 1363
  networkx.classes.digraph.DiGraph.succ:
  - 432
  - 415
  networkx.classes.digraph.DiGraph.successors:
  - 913
  - 937
  networkx.classes.digraph.DiGraph.to_undirected:
  - 1322
  - 1323
  - 1324
  - 1326
  - 1327
  - 1328
  - 1329
  - 1266
  - 1330
  - 1331
  - 1332
  - 1333
  - 1337
  - 1338
  - 1339
  - 1340
  networkx.classes.digraph._CachedPropertyResetterAdjAndSucc:
  - 23
  networkx.classes.digraph._CachedPropertyResetterAdjAndSucc.__set__:
  - 56
  - 55
  networkx.classes.digraph._CachedPropertyResetterPred:
  - 61
  networkx.classes.digraph._CachedPropertyResetterPred.__set__:
  - 83
  - 84
  networkx.classes.filters:
  - 1
  networkx.classes.filters.hide_diedges:
  - 33
  - 35
  networkx.classes.filters.hide_edges:
  - 40
  - 41
  - 39
  networkx.classes.filters.hide_multidiedges:
  - 45
  - 47
  networkx.classes.filters.hide_multiedges:
  - 51
  - 52
  - 53
  networkx.classes.filters.hide_nodes:
  - 27
  - 28
  - 29
  networkx.classes.filters.no_filter:
  - 22
  networkx.classes.filters.show_diedges:
  - 75
  - 77
  networkx.classes.filters.show_edges:
  - 81
  - 82
  - 83
  networkx.classes.filters.show_multidiedges:
  - 89
  - 87
  networkx.classes.filters.show_multiedges:
  - 93
  - 94
  - 95
  networkx.classes.filters.show_nodes:
  - 58
  networkx.classes.filters.show_nodes.__init__:
  - 68
  networkx.classes.function:
  - 672
  - 1
  - 928
  - 1153
  - 709
  - 1063
  - 746
  - 1099
  - 885
  - 570
  networkx.classes.function._create_describe_info_dict:
  - 1536
  - 1537
  - 1540
  - 1542
  - 1545
  - 1548
  - 1520
  - 1522
  - 1532
  - 1535
  networkx.classes.function.add_cycle:
  - 332
  - 334
  - 337
  - 338
  - 339
  - 310
  networkx.classes.function.add_path:
  - 300
  - 302
  - 305
  - 306
  - 278
  networkx.classes.function.add_star:
  - 267
  - 269
  - 272
  - 274
  - 243
  networkx.classes.function.all_neighbors:
  - 1013
  - 1012
  - 965
  - 1015
  networkx.classes.function.common_neighbors:
  - 1096
  - 1065
  - 1091
  - 1093
  networkx.classes.function.create_empty_copy:
  - 548
  - 563
  - 564
  - 565
  - 566
  networkx.classes.function.degree:
  - 74
  - 79
  networkx.classes.function.degree_histogram:
  - 160
  - 161
  - 142
  networkx.classes.function.density:
  - 131
  - 132
  - 133
  - 136
  - 107
  networkx.classes.function.describe:
  - 1507
  - 1509
  - 1510
  - 1511
  - 1513
  - 1514
  - 1451
  - 1515
  networkx.classes.function.edge_subgraph:
  - 453
  - 454
  - 455
  - 456
  - 457
  - 458
  - 459
  - 460
  - 462
  - 464
  - 465
  - 467
  - 468
  - 413
  networkx.classes.function.edges:
  - 70
  - 62
  networkx.classes.function.freeze:
  - 175
  networkx.classes.function.frozen:
  - 170
  networkx.classes.function.get_edge_attributes:
  - 887
  - 919
  - 920
  - 922
  - 923
  - 924
  networkx.classes.function.get_node_attributes:
  - 704
  - 705
  - 674
  - 706
  networkx.classes.function.induced_subgraph:
  - 408
  - 409
  - 367
  networkx.classes.function.is_directed:
  - 165
  - 166
  networkx.classes.function.is_empty:
  - 1209
  - 1228
  networkx.classes.function.is_frozen:
  - 225
  networkx.classes.function.is_negatively_weighted:
  - 1155
  - 1197
  - 1198
  - 1199
  - 1204
  networkx.classes.function.is_path:
  - 1387
  - 1407
  networkx.classes.function.is_weighted:
  - 1101
  - 1139
  - 1140
  - 1141
  - 1146
  - 1150
  networkx.classes.function.neighbors:
  - 83
  - 87
  networkx.classes.function.nodes:
  - 58
  - 54
  networkx.classes.function.nodes_with_selfloops:
  - 1232
  - 1255
  networkx.classes.function.non_edges:
  - 1056
  - 1058
  - 1059
  - 1060
  - 1039
  - 1051
  - 1052
  - 1053
  - 1054
  networkx.classes.function.non_neighbors:
  - 1035
  - 1020
  networkx.classes.function.number_of_edges:
  - 99
  - 103
  networkx.classes.function.number_of_nodes:
  - 91
  - 95
  networkx.classes.function.number_of_selfloops:
  - 1362
  - 1383
  networkx.classes.function.path_weight:
  - 1440
  - 1442
  - 1443
  - 1444
  - 1413
  - 1437
  networkx.classes.function.remove_edge_attributes:
  - 930
  - 949
  - 950
  - 952
  - 954
  - 956
  - 957
  networkx.classes.function.remove_node_attributes:
  - 737
  - 738
  - 739
  - 711
  - 734
  - 735
  networkx.classes.function.restricted_view:
  - 513
  - 514
  - 515
  - 516
  - 518
  - 520
  - 521
  - 523
  - 524
  - 472
  networkx.classes.function.selfloop_edges:
  - 1300
  - 1301
  - 1302
  - 1305
  - 1307
  - 1312
  - 1314
  - 1317
  - 1318
  - 1319
  - 1320
  - 1322
  - 1323
  - 1325
  - 1329
  - 1330
  - 1332
  - 1336
  - 1337
  - 1341
  - 1342
  - 1345
  - 1352
  - 1354
  - 1357
  - 1259
  networkx.classes.function.set_edge_attributes:
  - 866
  - 870
  - 871
  - 873
  - 748
  - 877
  - 879
  - 848
  - 882
  - 852
  - 853
  - 859
  networkx.classes.function.set_node_attributes:
  - 653
  - 655
  - 661
  - 664
  - 666
  - 572
  - 669
  networkx.classes.function.subgraph:
  - 344
  - 363
  networkx.classes.function.to_directed:
  - 528
  - 534
  networkx.classes.function.to_undirected:
  - 544
  - 538
  networkx.classes.graph:
  - 1
  networkx.classes.graph.Graph:
  - 72
  - 313
  - 314
  - 345
  networkx.classes.graph.Graph.__contains__:
  - 474
  networkx.classes.graph.Graph.__getitem__:
  - 510
  networkx.classes.graph.Graph.__init__:
  - 384
  - 350
  - 387
  - 388
  - 390
  - 391
  - 382
  - 383
  networkx.classes.graph.Graph.__iter__:
  - 456
  - 471
  networkx.classes.graph.Graph.__len__:
  - 488
  - 507
  networkx.classes.graph.Graph.__new__:
  - 347
  networkx.classes.graph.Graph.__str__:
  - 428
  - 447
  networkx.classes.graph.Graph.add_edge:
  - 969
  - 970
  - 972
  - 973
  - 974
  - 975
  - 977
  - 978
  - 980
  - 981
  - 918
  - 984
  networkx.classes.graph.Graph.add_edges_from:
  - 1056
  - 1058
  - 1059
  - 1060
  - 1061
  - 1062
  - 1051
  - 1065
  - 1041
  - 1042
  - 1043
  - 1045
  - 1050
  - 987
  - 1053
  - 1054
  - 1055
  networkx.classes.graph.Graph.add_node:
  - 577
  - 578
  - 579
  - 581
  - 582
  - 536
  - 574
  - 575
  networkx.classes.graph.Graph.add_nodes_from:
  - 645
  - 585
  - 652
  - 653
  - 654
  - 655
  - 657
  - 658
  - 659
  - 660
  networkx.classes.graph.Graph.add_weighted_edges_from:
  - 1115
  - 1068
  - 1116
  networkx.classes.graph.Graph.adj:
  - 410
  - 395
  networkx.classes.graph.Graph.adjacency:
  - 1491
  - 1508
  networkx.classes.graph.Graph.clear:
  - 1549
  - 1563
  - 1564
  - 1565
  - 1566
  networkx.classes.graph.Graph.clear_edges:
  - 1569
  - 1580
  - 1581
  - 1582
  networkx.classes.graph.Graph.copy:
  - 1669
  - 1670
  - 1671
  - 1672
  - 1673
  - 1674
  - 1675
  - 1676
  - 1677
  - 1593
  networkx.classes.graph.Graph.degree:
  - 1512
  - 1546
  networkx.classes.graph.Graph.edge_subgraph:
  - 1916
  - 1879
  networkx.classes.graph.Graph.edges:
  - 1442
  - 1389
  networkx.classes.graph.Graph.get_edge_data:
  - 1445
  networkx.classes.graph.Graph.has_edge:
  - 1304
  networkx.classes.graph.Graph.has_node:
  - 892
  networkx.classes.graph.Graph.is_directed:
  - 1589
  networkx.classes.graph.Graph.is_multigraph:
  - 1585
  networkx.classes.graph.Graph.name:
  - 425
  - 420
  - 414
  networkx.classes.graph.Graph.nbunch_iter:
  - 2081
  - 2053
  - 2054
  - 2055
  - 2056
  - 2014
  networkx.classes.graph.Graph.nbunch_iter.bunch_iter:
  - 2061
  - 2062
  - 2063
  - 2067
  - 2068
  - 2072
  - 2073
  - 2075
  - 2076
  networkx.classes.graph.Graph.neighbors:
  - 1345
  - 1383
  networkx.classes.graph.Graph.nodes:
  - 758
  - 847
  networkx.classes.graph.Graph.number_of_edges:
  - 2008
  - 2009
  - 1962
  - 2007
  networkx.classes.graph.Graph.number_of_nodes:
  - 850
  - 868
  networkx.classes.graph.Graph.order:
  - 889
  - 871
  networkx.classes.graph.Graph.remove_edge:
  - 1146
  - 1150
  - 1119
  networkx.classes.graph.Graph.remove_edges_from:
  - 1153
  - 1185
  - 1179
  - 1181
  - 1183
  networkx.classes.graph.Graph.remove_node:
  - 698
  - 701
  - 694
  - 663
  networkx.classes.graph.Graph.remove_nodes_from:
  - 704
  - 746
  - 754
  - 749
  networkx.classes.graph.Graph.size:
  - 1954
  - 1919
  networkx.classes.graph.Graph.subgraph:
  - 1795
  - 1869
  - 1872
  - 1873
  - 1876
  networkx.classes.graph.Graph.to_directed:
  - 1728
  - 1729
  - 1730
  - 1731
  - 1732
  - 1733
  - 1682
  - 1723
  - 1724
  - 1725
  - 1727
  networkx.classes.graph.Graph.to_directed_class:
  - 324
  networkx.classes.graph.Graph.to_undirected:
  - 1738
  - 1780
  - 1781
  - 1782
  - 1784
  - 1785
  - 1786
  - 1787
  - 1788
  - 1789
  - 1790
  networkx.classes.graph.Graph.to_undirected_class:
  - 332
  networkx.classes.graph.Graph.update:
  - 1282
  - 1283
  - 1188
  - 1285
  - 1284
  - 1293
  - 1295
  - 1296
  - 1297
  - 1298
  - 1299
  networkx.classes.graph._CachedPropertyResetterAdj:
  - 24
  networkx.classes.graph._CachedPropertyResetterAdj.__set__:
  - 43
  - 44
  networkx.classes.graph._CachedPropertyResetterNode:
  - 49
  networkx.classes.graph._CachedPropertyResetterNode.__set__:
  - 67
  networkx.classes.graphviews:
  - 1
  - 237
  networkx.classes.graphviews.generic_graph_view:
  - 128
  - 130
  - 104
  - 105
  - 43
  - 108
  - 107
  - 110
  - 117
  - 118
  - 126
  - 127
  networkx.classes.graphviews.reverse_view:
  - 266
  - 239
  networkx.classes.graphviews.subgraph_view:
  - 228
  - 229
  - 230
  - 137
  - 233
  - 207
  - 215
  - 216
  networkx.classes.graphviews.subgraph_view.reverse_edge:
  - 226
  - 220
  networkx.classes.multidigraph:
  - 1
  networkx.classes.multidigraph.MultiDiGraph:
  - 24
  - 308
  networkx.classes.multidigraph.MultiDiGraph.__init__:
  - 358
  - 360
  - 361
  - 363
  - 366
  - 368
  - 372
  - 374
  - 313
  networkx.classes.multidigraph.MultiDiGraph.__new__:
  - 310
  networkx.classes.multidigraph.MultiDiGraph.add_edge:
  - 512
  - 513
  - 517
  - 518
  - 519
  - 523
  - 429
  - 496
  - 497
  - 499
  - 500
  - 501
  - 502
  - 503
  - 505
  - 506
  - 507
  - 508
  - 509
  - 510
  networkx.classes.multidigraph.MultiDiGraph.adj:
  - 393
  - 378
  networkx.classes.multidigraph.MultiDiGraph.degree:
  - 769
  - 725
  networkx.classes.multidigraph.MultiDiGraph.edges:
  - 680
  - 603
  networkx.classes.multidigraph.MultiDiGraph.in_degree:
  - 820
  - 773
  networkx.classes.multidigraph.MultiDiGraph.in_edges:
  - 721
  - 691
  networkx.classes.multidigraph.MultiDiGraph.is_directed:
  - 877
  networkx.classes.multidigraph.MultiDiGraph.is_multigraph:
  - 873
  networkx.classes.multidigraph.MultiDiGraph.out_degree:
  - 824
  - 870
  networkx.classes.multidigraph.MultiDiGraph.out_edges:
  - 685
  networkx.classes.multidigraph.MultiDiGraph.pred:
  - 416
  - 426
  networkx.classes.multidigraph.MultiDiGraph.remove_edge:
  - 587
  - 588
  - 527
  - 595
  - 599
  networkx.classes.multidigraph.MultiDiGraph.reverse:
  - 968
  - 969
  - 970
  - 971
  - 972
  - 973
  - 974
  - 977
  - 956
  networkx.classes.multidigraph.MultiDiGraph.succ:
  - 412
  - 397
  networkx.classes.multidigraph.MultiDiGraph.to_undirected:
  - 931
  - 932
  - 933
  - 935
  - 936
  - 937
  - 938
  - 939
  - 940
  - 941
  - 942
  - 943
  - 881
  - 947
  - 948
  - 949
  - 950
  - 951
  networkx.classes.multigraph:
  - 1
  networkx.classes.multigraph.MultiGraph:
  - 16
  - 316
  networkx.classes.multigraph.MultiGraph.__init__:
  - 321
  - 366
  - 368
  - 369
  - 371
  - 374
  - 376
  - 380
  - 382
  networkx.classes.multigraph.MultiGraph.__new__:
  - 318
  networkx.classes.multigraph.MultiGraph.add_edge:
  - 513
  - 514
  - 515
  - 516
  - 518
  - 519
  - 520
  - 521
  - 522
  - 524
  - 525
  - 529
  - 530
  - 531
  - 535
  - 443
  - 510
  - 511
  networkx.classes.multigraph.MultiGraph.add_edges_from:
  - 608
  - 609
  - 611
  - 614
  - 622
  - 624
  - 626
  - 629
  - 630
  - 631
  - 632
  - 539
  - 607
  networkx.classes.multigraph.MultiGraph.adj:
  - 386
  - 411
  networkx.classes.multigraph.MultiGraph.copy:
  - 1120
  - 1035
  - 1111
  - 1112
  - 1113
  - 1114
  - 1115
  - 1116
  - 1117
  - 1118
  - 1119
  networkx.classes.multigraph.MultiGraph.degree:
  - 1024
  - 988
  networkx.classes.multigraph.MultiGraph.edges:
  - 835
  - 907
  networkx.classes.multigraph.MultiGraph.get_edge_data:
  - 979
  - 910
  networkx.classes.multigraph.MultiGraph.has_edge:
  - 826
  - 774
  networkx.classes.multigraph.MultiGraph.is_directed:
  - 1031
  networkx.classes.multigraph.MultiGraph.is_multigraph:
  - 1027
  networkx.classes.multigraph.MultiGraph.new_edge_key:
  - 437
  - 414
  networkx.classes.multigraph.MultiGraph.number_of_edges:
  - 1288
  - 1289
  - 1294
  - 1239
  networkx.classes.multigraph.MultiGraph.remove_edge:
  - 636
  - 707
  - 710
  - 712
  - 699
  - 700
  networkx.classes.multigraph.MultiGraph.remove_edges_from:
  - 768
  - 771
  - 715
  - 766
  networkx.classes.multigraph.MultiGraph.to_directed:
  - 1125
  - 1170
  - 1171
  - 1172
  - 1174
  - 1175
  - 1176
  - 1177
  - 1178
  - 1179
  - 1180
  - 1181
  networkx.classes.multigraph.MultiGraph.to_directed_class:
  - 295
  networkx.classes.multigraph.MultiGraph.to_undirected:
  - 1186
  - 1223
  - 1224
  - 1225
  - 1227
  - 1228
  - 1229
  - 1230
  - 1231
  - 1232
  - 1233
  - 1234
  networkx.classes.multigraph.MultiGraph.to_undirected_class:
  - 303
  networkx.classes.reportviews:
  - 1
  networkx.classes.reportviews.DegreeView:
  - 479
  networkx.classes.reportviews.DegreeView.__getitem__:
  - 528
  - 525
  - 526
  - 527
  networkx.classes.reportviews.DegreeView.__iter__:
  - 533
  - 534
  - 536
  - 538
  - 540
  - 541
  - 543
  networkx.classes.reportviews.DiDegreeView:
  - 384
  networkx.classes.reportviews.DiDegreeView.__call__:
  - 429
  - 430
  - 432
  - 434
  - 435
  - 437
  - 440
  networkx.classes.reportviews.DiDegreeView.__getitem__:
  - 448
  - 449
  - 446
  - 447
  networkx.classes.reportviews.DiDegreeView.__init__:
  - 424
  - 425
  - 423
  networkx.classes.reportviews.DiDegreeView.__iter__:
  - 454
  - 455
  - 458
  - 460
  - 463
  - 464
  - 466
  networkx.classes.reportviews.DiDegreeView.__len__:
  - 469
  networkx.classes.reportviews.DiDegreeView.__repr__:
  - 475
  networkx.classes.reportviews.DiDegreeView.__str__:
  - 472
  networkx.classes.reportviews.DiMultiDegreeView:
  - 633
  networkx.classes.reportviews.DiMultiDegreeView.__getitem__:
  - 640
  - 641
  - 644
  - 645
  - 646
  - 647
  - 639
  networkx.classes.reportviews.DiMultiDegreeView.__iter__:
  - 672
  - 674
  - 653
  - 654
  - 657
  - 658
  - 660
  - 662
  - 665
  - 666
  - 667
  - 668
  - 669
  - 670
  - 671
  networkx.classes.reportviews.EdgeDataView:
  - 823
  networkx.classes.reportviews.EdgeDataView.__contains__:
  - 873
  - 867
  networkx.classes.reportviews.EdgeDataView.__iter__:
  - 858
  - 859
  - 860
  - 861
  networkx.classes.reportviews.EdgeDataView.__len__:
  - 854
  networkx.classes.reportviews.EdgeView:
  - 1196
  networkx.classes.reportviews.EdgeView.__iter__:
  - 1276
  - 1277
  - 1278
  - 1279
  networkx.classes.reportviews.EdgeView.__len__:
  - 1272
  - 1271
  networkx.classes.reportviews.InDegreeView:
  - 570
  networkx.classes.reportviews.InDegreeView.__getitem__:
  - 576
  - 577
  - 575
  networkx.classes.reportviews.InDegreeView.__iter__:
  - 581
  - 582
  - 584
  - 586
  - 588
  - 589
  networkx.classes.reportviews.InEdgeDataView:
  - 877
  networkx.classes.reportviews.InEdgeDataView.__contains__:
  - 896
  - 890
  networkx.classes.reportviews.InEdgeDataView.__iter__:
  - 883
  - 884
  - 885
  networkx.classes.reportviews.InEdgeView:
  - 1292
  networkx.classes.reportviews.InEdgeView.__getitem__:
  - 1321
  networkx.classes.reportviews.InEdgeView.__init__:
  - 1305
  networkx.classes.reportviews.InEdgeView.__iter__:
  - 1309
  - 1310
  - 1311
  networkx.classes.reportviews.InMultiDegreeView:
  - 678
  networkx.classes.reportviews.InMultiDegreeView.__getitem__:
  - 683
  - 684
  - 686
  - 687
  networkx.classes.reportviews.InMultiDegreeView.__iter__:
  - 705
  - 692
  - 693
  - 695
  - 696
  - 698
  - 700
  - 701
  - 702
  - 703
  networkx.classes.reportviews.InMultiEdgeDataView:
  - 1020
  networkx.classes.reportviews.InMultiEdgeDataView.__contains__:
  - 1040
  - 1034
  - 1043
  - 1044
  networkx.classes.reportviews.InMultiEdgeDataView.__iter__:
  - 1026
  - 1027
  - 1028
  - 1029
  networkx.classes.reportviews.InMultiEdgeView:
  - 1404
  networkx.classes.reportviews.InMultiEdgeView.__contains__:
  - 1427
  - 1428
  - 1430
  networkx.classes.reportviews.InMultiEdgeView.__getitem__:
  - 1441
  networkx.classes.reportviews.InMultiEdgeView.__init__:
  - 1417
  networkx.classes.reportviews.InMultiEdgeView.__iter__:
  - 1424
  - 1421
  - 1422
  - 1423
  networkx.classes.reportviews.MultiDegreeView:
  - 593
  networkx.classes.reportviews.MultiDegreeView.__getitem__:
  - 598
  - 599
  - 600
  - 603
  - 604
  - 606
  - 607
  networkx.classes.reportviews.MultiDegreeView.__iter__:
  - 612
  - 613
  - 615
  - 616
  - 618
  - 620
  - 622
  - 623
  - 624
  - 625
  - 627
  - 628
  - 629
  networkx.classes.reportviews.MultiEdgeDataView:
  - 984
  networkx.classes.reportviews.MultiEdgeDataView.__contains__:
  - 1000
  - 1009
  - 1016
  - 1015
  networkx.classes.reportviews.MultiEdgeDataView.__iter__:
  - 992
  - 993
  - 994
  - 990
  - 991
  networkx.classes.reportviews.MultiEdgeView:
  - 1383
  networkx.classes.reportviews.MultiEdgeView.__iter__:
  - 1394
  - 1395
  - 1396
  - 1397
  - 1398
  networkx.classes.reportviews.MultiEdgeView.__len__:
  - 1390
  networkx.classes.reportviews.NodeDataView:
  - 288
  networkx.classes.reportviews.NodeDataView.__contains__:
  - 350
  networkx.classes.reportviews.NodeDataView.__getitem__:
  - 366
  - 359
  networkx.classes.reportviews.NodeDataView.__iter__:
  - 335
  - 336
  - 337
  - 338
  - 341
  networkx.classes.reportviews.NodeDataView.__len__:
  - 331
  networkx.classes.reportviews.NodeDataView.__repr__:
  - 375
  - 376
  - 377
  - 378
  - 379
  networkx.classes.reportviews.NodeDataView.__str__:
  - 371
  networkx.classes.reportviews.NodeDataView._from_iterable:
  - 323
  - 325
  networkx.classes.reportviews.NodeView:
  - 119
  networkx.classes.reportviews.NodeView.__call__:
  - 208
  - 210
  networkx.classes.reportviews.NodeView.__getitem__:
  - 191
  networkx.classes.reportviews.NodeView.__iter__:
  - 188
  networkx.classes.reportviews.NodeView.__len__:
  - 185
  networkx.classes.reportviews.NodeView.__repr__:
  - 284
  networkx.classes.reportviews.NodeView.__str__:
  - 281
  networkx.classes.reportviews.NodeView._from_iterable:
  - 204
  networkx.classes.reportviews.NodeView.data:
  - 276
  - 213
  - 278
  networkx.classes.reportviews.OutDegreeView:
  - 547
  networkx.classes.reportviews.OutDegreeView.__getitem__:
  - 552
  - 553
  - 554
  networkx.classes.reportviews.OutDegreeView.__iter__:
  - 558
  - 559
  - 561
  - 563
  - 565
  - 566
  networkx.classes.reportviews.OutEdgeDataView:
  - 748
  networkx.classes.reportviews.OutEdgeDataView.__contains__:
  - 813
  - 807
  networkx.classes.reportviews.OutEdgeDataView.__init__:
  - 774
  - 778
  - 779
  - 784
  - 785
  - 786
  - 787
  - 790
  networkx.classes.reportviews.OutEdgeDataView.__iter__:
  - 800
  - 801
  - 802
  networkx.classes.reportviews.OutEdgeDataView.__len__:
  - 796
  networkx.classes.reportviews.OutEdgeDataView.__repr__:
  - 819
  networkx.classes.reportviews.OutEdgeDataView.__setstate__:
  - 769
  networkx.classes.reportviews.OutEdgeDataView.__str__:
  - 816
  networkx.classes.reportviews.OutEdgeView:
  - 1049
  networkx.classes.reportviews.OutEdgeView.__call__:
  - 1105
  - 1103
  networkx.classes.reportviews.OutEdgeView.__getitem__:
  - 1090
  networkx.classes.reportviews.OutEdgeView.__init__:
  - 1069
  networkx.classes.reportviews.OutEdgeView.__iter__:
  - 1077
  - 1078
  - 1079
  networkx.classes.reportviews.OutEdgeView.__len__:
  - 1074
  networkx.classes.reportviews.OutEdgeView.__repr__:
  - 1192
  networkx.classes.reportviews.OutEdgeView.__str__:
  - 1189
  networkx.classes.reportviews.OutEdgeView._from_iterable:
  - 1063
  networkx.classes.reportviews.OutEdgeView.data:
  - 1185
  - 1108
  - 1183
  networkx.classes.reportviews.OutMultiDegreeView:
  - 709
  networkx.classes.reportviews.OutMultiDegreeView.__getitem__:
  - 714
  - 715
  - 717
  - 718
  networkx.classes.reportviews.OutMultiDegreeView.__iter__:
  - 736
  - 723
  - 724
  - 726
  - 727
  - 729
  - 731
  - 732
  - 733
  - 734
  networkx.classes.reportviews.OutMultiEdgeDataView:
  - 900
  networkx.classes.reportviews.OutMultiEdgeDataView.__contains__:
  - 979
  - 980
  - 973
  - 967
  networkx.classes.reportviews.OutMultiEdgeDataView.__init__:
  - 930
  - 931
  - 932
  - 934
  - 935
  - 936
  - 937
  - 939
  - 941
  - 943
  - 949
  - 920
  - 924
  - 925
  networkx.classes.reportviews.OutMultiEdgeDataView.__iter__:
  - 960
  - 961
  - 962
  - 959
  networkx.classes.reportviews.OutMultiEdgeDataView.__len__:
  - 955
  networkx.classes.reportviews.OutMultiEdgeDataView.__setstate__:
  - 914
  networkx.classes.reportviews.OutMultiEdgeView:
  - 1331
  networkx.classes.reportviews.OutMultiEdgeView.__call__:
  - 1372
  - 1374
  networkx.classes.reportviews.OutMultiEdgeView.__contains__:
  - 1352
  - 1349
  - 1350
  networkx.classes.reportviews.OutMultiEdgeView.__getitem__:
  - 1363
  networkx.classes.reportviews.OutMultiEdgeView.__iter__:
  - 1344
  - 1345
  - 1346
  - 1343
  networkx.classes.reportviews.OutMultiEdgeView.__len__:
  - 1338
  - 1339
  networkx.classes.reportviews.OutMultiEdgeView.data:
  - 1377
  - 1379
  networkx.conftest:
  - 1
  - 257
  - 259
  - 103
  - 247
  - 249
  - 251
  - 253
  - 126
  - 255
  networkx.conftest.pytest_addoption:
  - 25
  - 34
  - 28
  networkx.conftest.pytest_collection_modifyitems:
  - 96
  - 97
  - 98
  - 99
  - 81
  - 85
  - 89
  - 90
  - 91
  - 93
  networkx.conftest.pytest_configure:
  - 65
  - 66
  - 69
  - 70
  - 71
  - 72
  - 44
  - 45
  - 46
  - 47
  - 49
  - 50
  - 51
  - 60
  networkx.conftest.set_warnings:
  - 105
  - 110
  - 115
  - 118
  - 121
  networkx.convert:
  - 1
  - 460
  - 212
  - 373
  - 478
  networkx.convert.from_dict_of_dicts:
  - 402
  - 403
  - 405
  - 406
  - 407
  - 408
  - 410
  - 411
  - 412
  - 415
  - 417
  - 418
  - 419
  - 422
  - 423
  - 424
  - 425
  - 426
  - 427
  - 428
  - 430
  - 432
  - 433
  - 434
  - 435
  - 436
  - 437
  - 439
  - 442
  - 446
  - 447
  - 448
  - 449
  - 450
  - 451
  - 452
  - 454
  - 455
  - 375
  networkx.convert.from_dict_of_lists:
  - 234
  - 235
  - 236
  - 241
  - 242
  - 243
  - 244
  - 214
  - 247
  - 248
  networkx.convert.from_edgelist:
  - 480
  - 500
  - 501
  networkx.convert.to_dict_of_dicts:
  - 352
  - 353
  - 354
  - 355
  - 357
  - 358
  - 360
  - 361
  - 363
  - 366
  - 368
  - 254
  networkx.convert.to_dict_of_lists:
  - 208
  - 203
  - 188
  - 207
  networkx.convert.to_edgelist:
  - 473
  - 474
  - 475
  - 462
  networkx.convert.to_networkx_graph:
  - 128
  - 130
  - 136
  - 149
  - 151
  - 35
  - 163
  - 165
  - 177
  - 179
  - 74
  - 76
  - 79
  - 82
  - 87
  - 88
  - 94
  - 96
  - 100
  - 105
  - 110
  - 112
  - 117
  - 119
  - 127
  networkx.convert_matrix:
  - 1120
  - 1
  - 776
  - 489
  - 45
  - 881
  - 311
  - 153
  - 219
  networkx.convert_matrix._coo_gen_triples:
  - 746
  - 742
  networkx.convert_matrix._csc_gen_triples:
  - 729
  - 738
  - 737
  networkx.convert_matrix._csr_gen_triples:
  - 724
  - 716
  - 725
  networkx.convert_matrix._dok_gen_triples:
  - 754
  - 756
  - 750
  networkx.convert_matrix._generate_weighted_edges:
  - 768
  - 769
  - 770
  - 771
  - 773
  - 760
  - 766
  - 767
  networkx.convert_matrix.from_numpy_array:
  - 1280
  - 1288
  - 1289
  - 1291
  - 1292
  - 1295
  - 1298
  - 1307
  - 1310
  - 1311
  - 1313
  - 1234
  - 1235
  - 1238
  - 1245
  - 1246
  - 1248
  - 1124
  - 1252
  - 1255
  - 1257
  - 1259
  - 1260
  - 1269
  - 1270
  networkx.convert_matrix.from_pandas_adjacency:
  - 209
  - 155
  - 214
  networkx.convert_matrix.from_pandas_edgelist:
  - 429
  - 431
  - 432
  - 433
  - 434
  - 436
  - 440
  - 441
  - 446
  - 320
  - 448
  - 452
  - 458
  - 463
  - 465
  - 468
  - 473
  - 474
  - 476
  - 478
  - 480
  - 482
  - 483
  - 484
  networkx.convert_matrix.from_scipy_sparse_array:
  - 866
  - 875
  - 780
  - 844
  - 846
  - 877
  - 849
  - 852
  - 858
  networkx.convert_matrix.to_numpy_array:
  - 1043
  - 1044
  - 1045
  - 1048
  - 1049
  - 1051
  - 1054
  - 1057
  - 1063
  - 1064
  - 1073
  - 1074
  - 1075
  - 1078
  - 1079
  - 1083
  - 1084
  - 1085
  - 1086
  - 1087
  - 1092
  - 1094
  - 1095
  - 1096
  - 1097
  - 1100
  - 1101
  - 1103
  - 1107
  - 1108
  - 1109
  - 1110
  - 1114
  - 891
  networkx.convert_matrix.to_pandas_adjacency:
  - 139
  - 148
  - 149
  - 150
  - 55
  networkx.convert_matrix.to_pandas_edgelist:
  - 290
  - 291
  - 228
  - 293
  - 296
  - 297
  - 299
  - 300
  - 302
  - 307
  - 308
  - 283
  - 284
  - 286
  networkx.convert_matrix.to_scipy_sparse_array:
  - 664
  - 667
  - 668
  - 669
  - 671
  - 672
  - 674
  - 675
  - 676
  - 677
  - 680
  - 681
  - 683
  - 684
  - 685
  - 693
  - 694
  - 702
  - 703
  - 704
  - 708
  - 710
  - 491
  networkx.drawing.layout:
  - 1
  - 1602
  - 451
  - 1603
  - 659
  - 723
  - 1465
  - 63
  networkx.drawing.layout._energy_fruchterman_reingold:
  - 832
  - 835
  - 836
  - 871
  - 872
  - 822
  - 827
  - 829
  networkx.drawing.layout._energy_fruchterman_reingold._cost_FR:
  - 864
  - 867
  - 840
  - 841
  - 843
  - 844
  - 848
  - 849
  - 850
  - 854
  - 856
  - 858
  - 860
  - 861
  networkx.drawing.layout._fruchterman_reingold:
  - 673
  - 675
  - 707
  - 678
  - 710
  - 711
  - 681
  - 682
  - 712
  - 718
  - 687
  - 691
  - 695
  - 699
  - 701
  - 703
  networkx.drawing.layout._kamada_kawai_costfn:
  - 1003
  - 1006
  - 1007
  - 1010
  - 1012
  - 1013
  - 1018
  - 1019
  - 1022
  networkx.drawing.layout._kamada_kawai_solve:
  - 997
  - 987
  - 989
  - 991
  networkx.drawing.layout._process_params:
  - 46
  - 47
  - 48
  - 51
  - 52
  - 54
  - 56
  networkx.drawing.layout._sparse_fruchterman_reingold:
  - 770
  - 772
  - 776
  - 781
  - 782
  - 785
  - 786
  - 791
  - 793
  - 795
  - 797
  - 801
  - 804
  - 809
  - 748
  - 750
  - 753
  - 756
  - 760
  - 761
  - 763
  - 764
  networkx.drawing.layout._sparse_spectral:
  - 1157
  - 1162
  - 1164
  - 1165
  - 1166
  networkx.drawing.layout._spectral:
  - 1137
  - 1139
  - 1140
  - 1134
  networkx.drawing.layout.arf_layout:
  - 1542
  - 1546
  - 1547
  - 1550
  - 1551
  - 1552
  - 1555
  - 1557
  - 1561
  - 1562
  - 1563
  - 1564
  - 1569
  - 1572
  - 1579
  - 1583
  - 1584
  - 1586
  - 1589
  - 1590
  - 1594
  - 1596
  - 1597
  - 1478
  networkx.drawing.layout.bfs_layout:
  - 2017
  - 2020
  - 2022
  - 2029
  - 1966
  - 2033
  - 2034
  networkx.drawing.layout.bipartite_layout:
  - 410
  - 414
  - 415
  - 422
  - 423
  - 424
  - 426
  - 427
  - 429
  - 431
  - 432
  - 433
  - 434
  - 436
  - 437
  - 439
  - 440
  - 441
  - 443
  - 445
  - 446
  - 331
  networkx.drawing.layout.circular_layout:
  - 192
  - 194
  - 131
  - 196
  - 197
  - 200
  - 201
  - 202
  - 203
  - 205
  - 206
  - 208
  - 209
  - 187
  - 190
  networkx.drawing.layout.forceatlas2_layout:
  - 1802
  - 1806
  - 1809
  - 1810
  - 1811
  - 1812
  - 1813
  - 1816
  - 1818
  - 1692
  - 1695
  - 1696
  - 1697
  - 1698
  - 1699
  - 1823
  - 1828
  - 1702
  - 1703
  - 1704
  - 1829
  - 1706
  - 1707
  - 1708
  - 1709
  - 1831
  - 1711
  - 1712
  - 1834
  - 1835
  - 1839
  - 1716
  - 1840
  - 1841
  - 1848
  - 1721
  - 1849
  - 1851
  - 1724
  - 1725
  - 1726
  - 1728
  - 1729
  - 1730
  - 1731
  - 1732
  - 1861
  - 1862
  - 1864
  - 1865
  - 1867
  - 1868
  - 1872
  - 1875
  - 1876
  - 1877
  - 1622
  networkx.drawing.layout.forceatlas2_layout.estimate_factor:
  - 1795
  - 1735
  - 1771
  - 1772
  - 1776
  - 1777
  - 1779
  - 1780
  - 1782
  - 1783
  - 1788
  - 1789
  - 1791
  networkx.drawing.layout.kamada_kawai_layout:
  - 941
  - 942
  - 943
  - 946
  - 947
  - 948
  - 949
  - 950
  - 953
  - 954
  - 958
  - 959
  - 960
  - 961
  - 962
  - 964
  - 965
  - 967
  - 969
  - 970
  - 972
  - 973
  - 886
  networkx.drawing.layout.multipartite_layout:
  - 1411
  - 1415
  - 1416
  - 1421
  - 1427
  - 1428
  - 1432
  - 1436
  - 1442
  - 1443
  - 1444
  - 1445
  - 1446
  - 1448
  - 1449
  - 1452
  - 1453
  - 1454
  - 1455
  - 1457
  - 1459
  - 1460
  - 1356
  networkx.drawing.layout.planar_layout:
  - 1217
  - 1220
  - 1222
  - 1225
  - 1228
  - 1229
  - 1231
  - 1232
  - 1233
  - 1170
  - 1234
  - 1235
  - 1236
  - 1237
  - 1238
  networkx.drawing.layout.random_layout:
  - 65
  - 119
  - 120
  - 121
  - 122
  - 124
  - 125
  networkx.drawing.layout.rescale_layout:
  - 1920
  - 1922
  - 1883
  - 1919
  networkx.drawing.layout.rescale_layout_dict:
  - 1958
  - 1928
  - 1960
  - 1962
  - 1961
  networkx.drawing.layout.shell_layout:
  - 318
  - 289
  - 291
  - 293
  - 295
  - 313
  - 302
  - 303
  - 306
  - 309
  - 279
  - 312
  - 217
  - 282
  - 284
  - 317
  - 286
  - 287
  networkx.drawing.layout.spectral_layout:
  - 1026
  - 1086
  - 1088
  - 1089
  - 1090
  - 1091
  - 1092
  - 1094
  - 1095
  - 1098
  - 1100
  - 1102
  - 1103
  - 1104
  - 1107
  - 1109
  - 1111
  - 1113
  - 1114
  - 1116
  - 1117
  networkx.drawing.layout.spiral_layout:
  - 1345
  - 1314
  - 1251
  - 1347
  - 1317
  - 1348
  - 1319
  - 1321
  - 1322
  - 1323
  - 1324
  - 1328
  - 1333
  - 1336
  - 1339
  - 1341
  - 1343
  networkx.drawing.layout.spring_layout:
  - 642
  - 643
  - 646
  - 647
  - 648
  - 650
  - 651
  - 589
  - 591
  - 592
  - 594
  - 596
  - 469
  - 597
  - 599
  - 600
  - 602
  - 603
  - 605
  - 607
  - 608
  - 610
  - 612
  - 613
  - 614
  - 619
  - 621
  - 622
  - 623
  - 624
  - 628
  - 629
  - 630
  - 633
  - 634
  - 638
  - 639
  networkx.drawing.nx_agraph:
  - 1
  - 210
  - 36
  - 325
  networkx.drawing.nx_agraph.from_agraph:
  - 38
  - 68
  - 69
  - 70
  - 75
  - 81
  - 82
  - 86
  - 89
  - 90
  - 91
  - 94
  - 95
  - 96
  - 97
  - 98
  - 99
  - 101
  - 103
  - 107
  - 108
  - 110
  - 111
  - 113
  - 114
  networkx.drawing.nx_agraph.graphviz_layout:
  - 232
  - 262
  networkx.drawing.nx_agraph.pygraphviz_layout:
  - 320
  - 266
  - 309
  - 311
  - 312
  - 314
  - 315
  - 317
  - 318
  networkx.drawing.nx_agraph.read_dot:
  - 225
  - 226
  - 227
  - 212
  networkx.drawing.nx_agraph.to_agraph:
  - 143
  - 144
  - 146
  - 149
  - 150
  - 151
  - 153
  - 154
  - 158
  - 159
  - 161
  - 162
  - 163
  - 166
  - 169
  - 170
  - 171
  - 172
  - 174
  - 175
  - 178
  - 179
  - 180
  - 182
  - 183
  - 120
  networkx.drawing.nx_agraph.view_pygraphviz:
  - 385
  - 386
  - 416
  - 417
  - 418
  - 421
  - 424
  - 425
  - 426
  - 429
  - 430
  - 439
  - 440
  - 442
  - 443
  - 445
  - 446
  - 447
  - 449
  - 451
  - 455
  - 329
  - 461
  - 462
  - 465
  - 468
  - 374
  networkx.drawing.nx_agraph.view_pygraphviz.clean_attrs:
  - 410
  - 412
  networkx.drawing.nx_agraph.view_pygraphviz.func:
  - 433
  networkx.drawing.nx_agraph.view_pygraphviz.update_attrs:
  - 403
  - 404
  - 406
  networkx.drawing.nx_agraph.write_dot:
  - 205
  - 204
  - 189
  - 206
  networkx.drawing.nx_latex:
  - 480
  - 1
  - 139
  networkx.drawing.nx_latex.to_latex:
  - 452
  - 453
  - 422
  - 423
  - 476
  - 331
  - 474
  - 467
  - 439
  - 440
  - 442
  - 475
  - 444
  - 446
  networkx.drawing.nx_latex.to_latex_raw:
  - 259
  - 261
  - 270
  - 272
  - 274
  - 152
  - 281
  - 215
  - 216
  - 217
  - 219
  - 220
  - 221
  - 224
  - 227
  - 233
  - 234
  - 235
  - 236
  - 237
  - 238
  - 239
  - 240
  - 241
  - 242
  - 245
  - 246
  - 247
  - 248
  - 250
  - 253
  networkx.drawing.nx_latex.write_latex:
  - 482
  - 570
  networkx.drawing.nx_pydot:
  - 1
  - 38
  - 55
  - 56
  - 91
  networkx.drawing.nx_pydot.from_pydot:
  - 129
  - 130
  - 132
  - 135
  - 136
  - 140
  - 141
  - 142
  - 144
  - 147
  - 148
  - 149
  - 150
  - 154
  - 155
  - 157
  - 158
  - 160
  - 161
  - 163
  - 164
  - 166
  - 167
  - 168
  - 171
  - 172
  - 175
  - 179
  - 93
  - 118
  - 120
  - 123
  - 124
  - 125
  - 127
  networkx.drawing.nx_pydot.graphviz_layout:
  - 280
  - 251
  networkx.drawing.nx_pydot.pydot_layout:
  - 284
  - 323
  - 324
  - 325
  - 329
  - 332
  - 334
  - 335
  - 336
  - 337
  - 338
  - 339
  - 340
  - 344
  - 345
  - 351
  - 352
  - 353
  - 355
  - 357
  - 358
  - 359
  - 360
  networkx.drawing.nx_pydot.read_dot:
  - 88
  - 58
  - 85
  - 82
  networkx.drawing.nx_pydot.to_pydot:
  - 186
  - 205
  - 209
  - 212
  - 213
  - 214
  - 216
  - 220
  - 224
  - 228
  - 229
  - 230
  - 231
  - 232
  - 234
  - 235
  - 236
  - 237
  - 238
  - 239
  - 242
  - 243
  - 244
  - 245
  - 246
  networkx.drawing.nx_pydot.write_dot:
  - 40
  - 50
  - 51
  networkx.drawing.nx_pylab:
  - 1
  networkx.drawing.nx_pylab.CurvedArrowTextBase.__init__:
  - 131
  - 132
  - 134
  - 137
  - 139
  networkx.drawing.nx_pylab.CurvedArrowTextBase._get_arrow_path_disp:
  - 142
  - 151
  - 156
  - 157
  - 158
  - 159
  networkx.drawing.nx_pylab.CurvedArrowTextBase._update_text_pos_angle:
  - 192
  - 228
  - 198
  - 233
  - 204
  - 239
  - 208
  - 209
  - 210
  - 179
  - 180
  - 241
  - 214
  - 183
  - 243
  - 217
  - 245
  networkx.drawing.nx_pylab.CurvedArrowTextBase.draw:
  - 250
  - 251
  - 252
  - 254
  networkx.drawing.nx_pylab.FancyArrowFactory:
  - 1530
  networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.__init__:
  - 1544
  - 1542
  networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory.self_loop.self_loop_connection:
  - 1579
  - 1581
  - 1583
  - 1552
  - 1584
  - 1585
  - 1559
  - 1563
  networkx.drawing.nx_pylab.FancyArrowFactory.__call__:
  - 1666
  - 1668
  - 1669
  - 1670
  - 1671
  - 1673
  - 1675
  - 1676
  - 1679
  - 1684
  - 1686
  - 1689
  - 1691
  - 1692
  - 1695
  - 1699
  - 1700
  - 1701
  - 1702
  - 1704
  - 1707
  - 1711
  - 1712
  - 1716
  - 1718
  - 1719
  - 1720
  - 1721
  - 1727
  - 1648
  - 1649
  - 1650
  - 1651
  - 1657
  - 1658
  - 1659
  - 1660
  networkx.drawing.nx_pylab.FancyArrowFactory.__init__:
  - 1633
  - 1638
  - 1641
  - 1615
  - 1617
  - 1618
  networkx.drawing.nx_pylab.FancyArrowFactory.to_marker_edge:
  - 1745
  - 1742
  - 1743
  networkx.drawing.nx_pylab.apply_alpha:
  - 2948
  - 2949
  - 2950
  - 2951
  - 2957
  - 2959
  - 2960
  - 2903
  - 2968
  - 2969
  - 2973
  networkx.drawing.nx_pylab.apply_matplotlib_colors:
  - 96
  - 98
  - 99
  - 105
  - 106
  - 107
  - 110
  - 111
  - 51
  - 84
  - 85
  - 86
  - 87
  - 89
  - 91
  - 93
  - 94
  - 95
  networkx.drawing.nx_pylab.apply_matplotlib_colors.do_map:
  - 103
  networkx.drawing.nx_pylab.display:
  - 1024
  - 1025
  - 1033
  - 1035
  - 1037
  - 1038
  - 1039
  - 1040
  - 1042
  - 1046
  - 1047
  - 1048
  - 1049
  - 1050
  - 1051
  - 1054
  - 1059
  - 1064
  - 1067
  - 1068
  - 1069
  - 1070
  - 1071
  - 1072
  - 1073
  - 1076
  - 1077
  - 1078
  - 569
  - 570
  - 1085
  - 1086
  - 578
  - 579
  - 584
  - 585
  - 587
  - 588
  - 262
  - 813
  - 814
  - 815
  - 816
  - 821
  - 824
  - 828
  - 831
  - 832
  - 833
  - 837
  - 838
  - 839
  - 846
  - 847
  - 848
  - 849
  - 856
  - 863
  - 864
  - 866
  - 867
  - 868
  - 869
  - 873
  - 878
  - 887
  - 890
  - 893
  - 896
  - 902
  - 904
  - 906
  - 910
  - 911
  - 915
  - 918
  - 919
  - 920
  - 922
  - 924
  - 928
  - 929
  - 930
  - 931
  - 932
  - 935
  - 937
  - 942
  - 943
  - 944
  - 945
  - 950
  - 953
  - 954
  - 955
  - 959
  - 960
  - 961
  - 964
  - 965
  - 966
  - 968
  - 971
  - 972
  - 979
  - 980
  - 982
  - 983
  - 984
  - 985
  - 989
  - 992
  - 993
  - 995
  - 996
  - 999
  - 1001
  - 1008
  - 1009
  - 1010
  - 1012
  - 1013
  - 1014
  - 1016
  - 1019
  - 1022
  - 1023
  networkx.drawing.nx_pylab.display.build_fancy_arrow:
  - 771
  - 772
  - 773
  - 775
  - 777
  - 780
  - 781
  - 782
  - 784
  - 786
  - 788
  - 791
  - 793
  - 795
  - 796
  - 797
  - 800
  - 801
  - 802
  - 803
  networkx.drawing.nx_pylab.display.collection_compatible:
  - 652
  - 653
  - 654
  - 655
  networkx.drawing.nx_pylab.display.compute_colors:
  - 626
  - 627
  - 629
  - 633
  - 636
  networkx.drawing.nx_pylab.display.edge_property_sequence:
  - 673
  - 675
  - 676
  - 680
  - 661
  - 665
  - 667
  - 669
  - 670
  networkx.drawing.nx_pylab.display.get_edge_attr:
  - 683
  - 687
  - 689
  - 692
  - 694
  - 695
  - 699
  networkx.drawing.nx_pylab.display.get_node_attr:
  - 707
  - 709
  - 712
  - 714
  - 715
  - 719
  - 702
  networkx.drawing.nx_pylab.display.node_property_sequence:
  - 609
  - 610
  - 616
  - 618
  - 619
  - 623
  - 600
  - 605
  - 607
  networkx.drawing.nx_pylab.display.self_loop.self_loop_connection:
  - 737
  - 753
  - 755
  - 724
  - 757
  - 758
  - 759
  - 731
  - 734
  networkx.drawing.nx_pylab.display.to_marker_edge:
  - 768
  - 765
  - 766
  networkx.drawing.nx_pylab.draw:
  - 1153
  - 1154
  - 1155
  - 1092
  - 1156
  - 1157
  - 1159
  - 1161
  - 1164
  - 1165
  - 1166
  - 1150
  - 1151
  networkx.drawing.nx_pylab.draw_bipartite:
  - 2587
  - 2547
  networkx.drawing.nx_pylab.draw_circular:
  - 2626
  - 2591
  networkx.drawing.nx_pylab.draw_forceatlas2:
  - 2899
  - 2883
  networkx.drawing.nx_pylab.draw_kamada_kawai:
  - 2666
  - 2630
  networkx.drawing.nx_pylab.draw_networkx:
  - 1345
  - 1346
  - 1347
  - 1349
  - 1350
  - 1352
  - 1353
  - 1354
  - 1355
  - 1356
  - 1328
  - 1329
  - 1330
  - 1171
  - 1341
  - 1342
  networkx.drawing.nx_pylab.draw_networkx_edge_labels:
  - 2435
  - 2436
  - 2437
  - 2439
  - 2440
  - 2423
  - 2466
  - 2467
  - 2468
  - 2469
  - 2470
  - 2471
  - 2472
  - 2473
  - 2476
  - 2477
  - 2478
  - 2481
  - 2482
  - 2483
  - 2484
  - 2485
  - 2486
  - 2488
  - 2492
  - 2493
  - 2494
  - 2495
  - 2496
  - 2497
  - 2500
  - 2510
  - 2513
  - 2514
  - 2515
  - 2516
  - 2517
  - 2518
  - 2521
  - 2395
  - 2398
  - 2400
  - 2401
  - 2528
  - 2529
  - 2533
  - 2534
  - 2408
  - 2409
  - 2411
  - 2412
  - 2413
  - 2415
  - 2417
  - 2419
  - 2420
  - 2295
  - 2425
  - 2426
  - 2427
  - 2429
  networkx.drawing.nx_pylab.draw_networkx_edge_labels.<lambda1>:
  - 2426
  networkx.drawing.nx_pylab.draw_networkx_edge_labels.check_individual_params:
  - 2456
  - 2458
  - 2455
  networkx.drawing.nx_pylab.draw_networkx_edge_labels.get_param_value:
  - 2462
  - 2463
  networkx.drawing.nx_pylab.draw_networkx_edges:
  - 2068
  - 2069
  - 2077
  - 2078
  - 2079
  - 2080
  - 2081
  - 2086
  - 2087
  - 2088
  - 2090
  - 2091
  - 2092
  - 2093
  - 2094
  - 2097
  - 2098
  - 2099
  - 2100
  - 2105
  - 2106
  - 2108
  - 2109
  - 1772
  - 1945
  - 1946
  - 1948
  - 1952
  - 1954
  - 1955
  - 1963
  - 1971
  - 1972
  - 1973
  - 1974
  - 1975
  - 1976
  - 1977
  - 1979
  - 1980
  - 1981
  - 1983
  - 1984
  - 1985
  - 1989
  - 1990
  - 1992
  - 1993
  - 1995
  - 1996
  - 1998
  - 1999
  - 2000
  - 2001
  - 2003
  - 2007
  - 2008
  - 2011
  - 2015
  - 2019
  - 2020
  - 2021
  - 2022
  - 2024
  - 2025
  - 2027
  - 2028
  - 2029
  - 2030
  - 2031
  - 2032
  - 2033
  - 2036
  - 2037
  - 2038
  - 2039
  - 2046
  - 2047
  networkx.drawing.nx_pylab.draw_networkx_edges.<lambda1>:
  - 2000
  networkx.drawing.nx_pylab.draw_networkx_labels:
  - 2214
  - 2215
  - 2217
  - 2218
  - 2220
  - 2233
  - 2234
  - 2235
  - 2236
  - 2237
  - 2240
  - 2242
  - 2243
  - 2244
  - 2248
  - 2249
  - 2250
  - 2251
  - 2252
  - 2261
  - 2262
  - 2137
  networkx.drawing.nx_pylab.draw_networkx_labels.check_individual_params:
  - 2224
  - 2226
  - 2223
  networkx.drawing.nx_pylab.draw_networkx_labels.get_param_value:
  - 2229
  networkx.drawing.nx_pylab.draw_networkx_nodes:
  - 1473
  - 1474
  - 1476
  - 1477
  - 1479
  - 1480
  - 1483
  - 1487
  - 1488
  - 1491
  - 1492
  - 1494
  - 1495
  - 1377
  - 1509
  - 1510
  - 1519
  - 1520
  - 1521
  - 1523
  - 1525
  networkx.drawing.nx_pylab.draw_planar:
  - 2879
  - 2839
  networkx.drawing.nx_pylab.draw_random:
  - 2705
  - 2670
  networkx.drawing.nx_pylab.draw_shell:
  - 2794
  - 2835
  networkx.drawing.nx_pylab.draw_spectral:
  - 2747
  - 2709
  networkx.drawing.nx_pylab.draw_spring:
  - 2790
  - 2751
  networkx.exception:
  - 1
  networkx.exception.AmbiguousSolution:
  - 97
  networkx.exception.ExceededMaxIterations:
  - 109
  networkx.exception.HasACycle:
  - 77
  networkx.exception.NetworkXAlgorithmError:
  - 58
  networkx.exception.NetworkXError:
  - 32
  networkx.exception.NetworkXException:
  - 28
  networkx.exception.NetworkXNoCycle:
  - 72
  networkx.exception.NetworkXNoPath:
  - 67
  networkx.exception.NetworkXNotImplemented:
  - 89
  networkx.exception.NetworkXPointlessConcept:
  - 36
  networkx.exception.NetworkXUnbounded:
  - 84
  networkx.exception.NetworkXUnfeasible:
  - 62
  networkx.exception.NodeNotFound:
  - 93
  networkx.exception.PowerIterationFailedConvergence:
  - 119
  networkx.exception.PowerIterationFailedConvergence.__init__:
  - 130
  - 131
  networkx.generators:
  - 1
  networkx.generators.atlas:
  - 1
  - 90
  - 129
  - 53
  networkx.generators.atlas._generate_graphs:
  - 64
  - 65
  - 73
  - 74
  - 75
  - 79
  - 80
  - 81
  - 82
  - 83
  - 85
  - 86
  - 87
  - 57
  - 63
  networkx.generators.atlas.graph_atlas:
  - 124
  - 92
  - 126
  networkx.generators.atlas.graph_atlas_g:
  - 131
  - 227
  networkx.generators.classic:
  - 1
  - 916
  - 277
  - 790
  - 663
  - 791
  - 154
  - 929
  - 686
  - 687
  - 564
  - 565
  - 315
  - 316
  - 69
  - 967
  - 456
  - 457
  - 968
  - 204
  - 854
  - 855
  - 488
  - 107
  - 363
  - 1003
  - 753
  - 764
  - 765
  - 383
  networkx.generators.classic._tree_edges:
  - 64
  - 52
  - 56
  - 57
  - 59
  - 60
  - 62
  - 63
  networkx.generators.classic.balanced_tree:
  - 201
  - 195
  - 156
  networkx.generators.classic.barbell_graph:
  - 256
  - 260
  - 261
  - 262
  - 265
  - 266
  - 206
  - 270
  - 271
  - 272
  - 249
  - 251
  - 255
  networkx.generators.classic.binomial_tree:
  - 303
  - 306
  - 308
  - 309
  - 310
  - 279
  networkx.generators.classic.circulant_graph:
  - 385
  - 450
  - 451
  - 452
  networkx.generators.classic.circular_ladder_graph:
  - 377
  - 378
  - 379
  - 365
  networkx.generators.classic.complete_graph:
  - 353
  - 354
  - 355
  - 356
  - 358
  - 359
  - 318
  networkx.generators.classic.complete_multipartite_graph:
  - 1089
  - 1090
  - 1064
  - 1066
  - 1005
  - 1071
  - 1072
  - 1076
  - 1082
  - 1083
  networkx.generators.classic.cycle_graph:
  - 459
  - 484
  - 483
  networkx.generators.classic.dorogovtsev_goltsev_mendes_graph:
  - 545
  - 546
  - 548
  - 551
  - 553
  - 490
  - 555
  - 556
  - 557
  - 560
  - 542
  networkx.generators.classic.empty_graph:
  - 647
  - 648
  - 649
  - 650
  - 651
  - 655
  - 659
  - 567
  networkx.generators.classic.full_rary_tree:
  - 103
  - 102
  - 71
  networkx.generators.classic.kneser_graph:
  - 136
  - 138
  - 109
  - 141
  - 143
  - 145
  - 146
  - 148
  - 150
  networkx.generators.classic.ladder_graph:
  - 677
  - 678
  - 680
  - 681
  - 682
  - 665
  networkx.generators.classic.lollipop_graph:
  - 736
  - 740
  - 741
  - 742
  - 744
  - 748
  - 749
  - 689
  - 725
  - 726
  - 730
  - 731
  - 732
  - 735
  networkx.generators.classic.null_graph:
  - 760
  - 755
  networkx.generators.classic.path_graph:
  - 785
  - 786
  - 767
  networkx.generators.classic.star_graph:
  - 844
  - 845
  - 846
  - 848
  - 850
  - 793
  networkx.generators.classic.tadpole_graph:
  - 897
  - 898
  - 902
  - 903
  - 906
  - 907
  - 911
  - 857
  networkx.generators.classic.trivial_graph:
  - 925
  - 918
  networkx.generators.classic.turan_graph:
  - 931
  - 963
  - 959
  networkx.generators.classic.wheel_graph:
  - 992
  - 995
  - 997
  - 998
  - 999
  - 970
  - 991
  networkx.generators.cographs:
  - 1
  - 21
  - 22
  networkx.generators.cographs.random_cograph:
  - 64
  - 66
  - 24
  - 58
  - 60
  - 61
  - 63
  networkx.generators.cographs.random_cograph.<lambda1>:
  - 61
  networkx.generators.community:
  - 256
  - 1
  - 388
  - 70
  - 809
  - 810
  - 176
  - 177
  - 311
  - 497
  - 498
  - 23
  - 312
  - 444
  - 124
  - 125
  - 255
  networkx.generators.community.LFR_benchmark_graph:
  - 1024
  - 1027
  - 1028
  - 1029
  - 1030
  - 1048
  - 1053
  - 1058
  - 1059
  - 1060
  - 1061
  - 1062
  - 1063
  - 1064
  - 1065
  - 1066
  - 1067
  - 1068
  - 825
  - 994
  - 996
  - 998
  - 1002
  - 1004
  - 1006
  - 1010
  - 1011
  networkx.generators.community.LFR_benchmark_graph.condition:
  - 1043
  - 1019
  networkx.generators.community.LFR_benchmark_graph.length:
  - 1022
  - 1046
  networkx.generators.community._generate_communities:
  - 801
  - 802
  - 803
  - 785
  - 786
  - 787
  - 788
  - 789
  - 790
  - 759
  - 792
  - 796
  - 797
  - 799
  networkx.generators.community._generate_min_degree:
  - 741
  - 742
  - 745
  - 746
  - 747
  - 755
  - 727
  networkx.generators.community._generate_min_degree.zeta:
  - 734
  networkx.generators.community._hurwitz_zeta:
  - 717
  - 709
  - 719
  networkx.generators.community._powerlaw_sequence:
  - 678
  - 699
  - 701
  - 702
  - 703
  networkx.generators.community._zipf_rv_below:
  - 673
  - 666
  - 671
  networkx.generators.community.caveman_graph:
  - 64
  - 65
  - 66
  - 25
  - 62
  - 63
  networkx.generators.community.connected_caveman_graph:
  - 72
  - 112
  - 117
  - 118
  - 119
  - 120
  networkx.generators.community.gaussian_random_partition_graph:
  - 384
  - 385
  - 378
  - 372
  - 377
  - 314
  - 380
  - 381
  networkx.generators.community.planted_partition_graph:
  - 258
  - 308
  networkx.generators.community.random_partition_graph:
  - 233
  - 235
  - 239
  - 240
  - 241
  - 179
  - 244
  networkx.generators.community.relaxed_caveman_graph:
  - 164
  - 165
  - 166
  - 167
  - 168
  - 169
  - 171
  - 172
  - 127
  networkx.generators.community.ring_of_cliques:
  - 390
  - 427
  - 429
  - 432
  - 433
  - 434
  - 435
  - 437
  - 438
  networkx.generators.community.stochastic_block_model:
  - 640
  - 642
  - 643
  - 644
  - 645
  - 646
  - 647
  - 650
  - 651
  - 653
  - 654
  - 655
  - 659
  - 660
  - 661
  - 578
  - 581
  - 582
  - 584
  - 585
  - 586
  - 587
  - 588
  - 591
  - 592
  - 593
  - 596
  - 597
  - 599
  - 602
  - 605
  - 606
  - 607
  - 608
  - 610
  - 611
  - 613
  - 615
  - 616
  - 631
  - 619
  - 620
  - 621
  - 627
  - 628
  - 629
  - 502
  - 630
  - 633
  - 635
  - 636
  - 637
  - 638
  - 639
  networkx.generators.community.windmill_graph:
  - 482
  - 485
  - 488
  - 489
  - 490
  - 493
  - 446
  networkx.generators.degree_seq:
  - 1
  - 228
  - 229
  - 646
  - 711
  - 712
  - 331
  - 332
  - 534
  - 441
  - 125
  - 126
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.__init__:
  - 784
  - 786
  - 780
  - 781
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.generate:
  - 800
  - 802
  - 803
  - 804
  - 792
  - 794
  - 795
  - 797
  - 798
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase1:
  - 846
  - 847
  - 848
  - 850
  - 851
  - 852
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase2:
  - 865
  - 866
  - 867
  - 858
  - 860
  - 861
  - 863
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.phase3:
  - 871
  - 873
  - 874
  - 878
  - 881
  - 882
  - 884
  - 885
  - 886
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.q:
  - 831
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.suitable_edge:
  - 840
  - 841
  - 835
  - 839
  networkx.generators.degree_seq.DegreeSequenceRandomGraph.update_remaining:
  - 809
  - 811
  - 812
  - 814
  - 815
  - 818
  - 820
  - 821
  networkx.generators.degree_seq._configuration_model:
  - 102
  - 103
  - 59
  - 105
  - 107
  - 108
  - 110
  - 111
  - 113
  - 117
  - 119
  - 121
  - 90
  - 91
  - 93
  networkx.generators.degree_seq._to_stublist:
  - 25
  - 53
  networkx.generators.degree_seq.configuration_model:
  - 128
  - 215
  - 219
  - 220
  - 223
  networkx.generators.degree_seq.degree_sequence_tree:
  - 704
  - 705
  - 706
  - 648
  - 681
  - 682
  - 680
  - 685
  - 686
  - 689
  - 690
  - 696
  - 699
  - 700
  networkx.generators.degree_seq.directed_configuration_model:
  - 312
  - 233
  - 316
  - 319
  networkx.generators.degree_seq.directed_havel_hakimi_graph:
  - 640
  - 641
  - 536
  - 573
  - 574
  - 579
  - 580
  - 581
  - 582
  - 586
  - 588
  - 590
  - 592
  - 596
  - 597
  - 598
  - 599
  - 600
  - 601
  - 605
  - 606
  - 612
  - 614
  - 619
  - 620
  - 621
  - 624
  - 625
  - 627
  - 629
  - 634
  - 636
  - 637
  - 639
  networkx.generators.degree_seq.expected_degree_graph:
  - 416
  - 417
  - 420
  - 422
  - 424
  - 427
  - 429
  - 334
  - 430
  - 431
  - 432
  - 433
  - 434
  - 435
  - 405
  - 406
  - 409
  - 412
  networkx.generators.degree_seq.havel_hakimi_graph:
  - 516
  - 517
  - 519
  - 520
  - 522
  - 526
  - 528
  - 443
  - 481
  - 484
  - 485
  - 486
  - 488
  - 490
  - 492
  - 493
  - 494
  - 496
  - 503
  - 507
  - 511
  networkx.generators.degree_seq.random_degree_sequence_graph:
  - 769
  - 714
  - 766
  - 767
  networkx.generators.directed:
  - 96
  - 1
  - 97
  - 549
  - 422
  - 518
  - 341
  - 150
  - 151
  - 342
  - 28
  - 29
  - 190
  - 191
  networkx.generators.directed._random_k_out_graph_numpy:
  - 544
  - 522
  - 523
  - 524
  - 525
  - 527
  - 529
  - 530
  - 532
  - 533
  - 537
  - 540
  networkx.generators.directed._random_k_out_graph_python:
  - 551
  - 552
  - 553
  - 555
  - 556
  - 559
  - 560
  - 562
  - 564
  - 567
  - 570
  - 571
  networkx.generators.directed.gn_graph:
  - 70
  - 71
  - 74
  - 79
  - 82
  - 85
  - 87
  - 89
  - 90
  - 91
  - 31
  networkx.generators.directed.gnc_graph:
  - 185
  - 175
  - 176
  - 179
  - 182
  - 183
  - 184
  - 153
  - 186
  networkx.generators.directed.gnr_graph:
  - 99
  - 135
  - 136
  - 139
  - 142
  - 143
  - 144
  - 145
  - 146
  networkx.generators.directed.random_k_out_graph:
  - 424
  - 513
  - 515
  - 510
  networkx.generators.directed.random_uniform_k_out_graph:
  - 416
  - 417
  - 418
  - 408
  - 399
  - 400
  - 344
  - 415
  networkx.generators.directed.random_uniform_k_out_graph.sample:
  - 403
  - 411
  - 405
  - 413
  networkx.generators.directed.scale_free_graph:
  - 260
  - 261
  - 266
  - 268
  - 270
  - 272
  - 275
  - 278
  - 281
  - 285
  - 286
  - 289
  - 292
  - 293
  - 295
  - 300
  - 301
  - 304
  - 310
  - 312
  - 314
  - 317
  - 319
  - 324
  - 329
  - 202
  - 332
  - 335
  - 336
  networkx.generators.directed.scale_free_graph._choose_node:
  - 256
  - 257
  - 258
  - 253
  - 254
  - 255
  networkx.generators.duplication:
  - 1
  - 98
  - 97
  - 17
  - 18
  networkx.generators.duplication.duplication_divergence_graph:
  - 160
  - 163
  - 100
  - 164
  - 166
  - 168
  - 170
  - 143
  - 146
  - 150
  - 151
  - 154
  - 158
  networkx.generators.duplication.partial_duplication_graph:
  - 70
  - 71
  - 74
  - 77
  - 78
  - 80
  - 83
  - 20
  - 86
  - 88
  - 89
  - 92
  - 93
  networkx.generators.ego:
  - 1
  - 10
  networkx.generators.ego.ego_graph:
  - 64
  - 65
  - 12
  - 46
  - 47
  - 48
  - 49
  - 52
  - 53
  - 54
  - 58
  - 59
  - 61
  - 63
  networkx.generators.expanders:
  - 1
  - 356
  - 357
  - 358
  - 426
  - 427
  - 50
  - 157
  - 218
  - 219
  - 93
  networkx.generators.expanders.chordal_cycle_graph:
  - 132
  - 133
  - 137
  - 150
  - 151
  - 152
  - 95
  networkx.generators.expanders.is_regular_expander:
  - 416
  - 417
  - 420
  - 423
  - 360
  - 408
  - 411
  - 414
  networkx.generators.expanders.margulis_gabber_galil_graph:
  - 76
  - 77
  - 81
  - 82
  - 52
  - 88
  networkx.generators.expanders.maybe_regular_expander:
  - 345
  - 337
  - 351
  networkx.generators.expanders.maybe_regular_expander_graph:
  - 318
  - 289
  - 323
  - 292
  - 324
  - 325
  - 327
  - 297
  - 299
  - 331
  - 303
  - 306
  - 309
  - 313
  - 314
  - 283
  - 221
  - 286
  networkx.generators.expanders.paley_graph:
  - 201
  - 202
  - 209
  - 211
  - 212
  - 213
  - 159
  networkx.generators.expanders.random_regular_expander_graph:
  - 483
  - 488
  - 490
  - 494
  - 431
  networkx.generators.geometric:
  - 1
  - 705
  - 706
  - 840
  - 841
  - 332
  - 333
  - 208
  - 209
  - 114
  - 115
  - 499
  - 500
  - 22
  - 632
  - 633
  networkx.generators.geometric._geometric_edges:
  - 102
  - 103
  - 107
  - 108
  - 109
  - 110
  - 90
  - 94
  networkx.generators.geometric.geographical_threshold_graph:
  - 481
  - 495
  - 465
  - 468
  - 469
  - 475
  - 472
  - 473
  - 347
  - 477
  - 478
  networkx.generators.geometric.geographical_threshold_graph.should_join:
  - 493
  networkx.generators.geometric.geometric_edges:
  - 24
  - 76
  - 77
  - 86
  networkx.generators.geometric.geometric_soft_configuration_graph:
  - 1024
  - 1026
  - 1027
  - 1031
  - 1032
  - 1033
  - 1034
  - 1035
  - 845
  - 975
  - 978
  - 979
  - 984
  - 985
  - 987
  - 998
  - 1000
  - 1004
  - 1005
  - 1006
  - 1007
  - 1012
  - 1014
  - 1015
  - 1016
  - 1017
  - 1018
  - 1022
  - 1023
  networkx.generators.geometric.navigable_small_world_graph:
  - 701
  - 680
  - 682
  - 684
  - 687
  - 688
  - 689
  - 691
  - 692
  - 694
  - 695
  - 696
  - 697
  - 698
  - 635
  - 700
  - 699
  networkx.generators.geometric.random_geometric_graph:
  - 197
  - 200
  - 201
  - 202
  - 204
  - 119
  networkx.generators.geometric.soft_random_geometric_graph:
  - 328
  - 308
  - 213
  - 312
  - 313
  - 314
  - 318
  networkx.generators.geometric.soft_random_geometric_graph.p_dist:
  - 321
  networkx.generators.geometric.soft_random_geometric_graph.should_join:
  - 325
  - 326
  networkx.generators.geometric.thresholded_random_geometric_graph:
  - 833
  - 836
  - 720
  - 817
  - 821
  - 822
  - 825
  - 826
  - 828
  - 829
  networkx.generators.geometric.waxman_graph:
  - 512
  - 613
  - 614
  - 628
  - 599
  - 602
  - 603
  - 605
  networkx.generators.geometric.waxman_graph.dist:
  - 617
  - 622
  networkx.generators.geometric.waxman_graph.should_join:
  - 626
  networkx.generators.harary_graph:
  - 24
  - 1
  - 98
  networkx.generators.harary_graph.hkn_harary_graph:
  - 161
  - 100
  - 141
  - 143
  - 147
  - 148
  - 151
  - 154
  - 156
  - 158
  networkx.generators.harary_graph.hnm_harary_graph:
  - 68
  - 90
  - 70
  - 72
  - 79
  - 82
  - 84
  - 86
  - 26
  - 93
  networkx.generators.internet_as_graphs:
  - 1
  - 401
  - 36
  - 402
  networkx.generators.internet_as_graphs.AS_graph_generator:
  - 73
  - 75
  networkx.generators.internet_as_graphs.AS_graph_generator.__init__:
  - 99
  - 100
  - 101
  - 102
  - 77
  networkx.generators.internet_as_graphs.AS_graph_generator.add_cp_peering_link:
  - 292
  - 293
  - 294
  - 295
  - 298
  - 301
  - 302
  - 305
  - 275
  - 308
  - 309
  - 310
  - 312
  - 313
  - 314
  networkx.generators.internet_as_graphs.AS_graph_generator.add_customer:
  - 167
  - 169
  - 170
  - 171
  - 172
  - 173
  networkx.generators.internet_as_graphs.AS_graph_generator.add_edge:
  - 138
  - 139
  - 142
  networkx.generators.internet_as_graphs.AS_graph_generator.add_m_peering_link:
  - 257
  - 258
  - 261
  - 262
  - 263
  - 265
  - 266
  - 235
  - 267
  - 253
  - 255
  networkx.generators.internet_as_graphs.AS_graph_generator.add_node:
  - 176
  - 200
  - 202
  - 204
  - 205
  - 206
  - 207
  - 208
  - 209
  - 210
  - 212
  - 214
  - 215
  - 216
  - 217
  - 219
  - 220
  - 221
  - 223
  - 224
  - 226
  - 227
  - 228
  - 229
  networkx.generators.internet_as_graphs.AS_graph_generator.add_peering_links:
  - 335
  - 337
  - 340
  - 342
  - 347
  - 348
  - 349
  - 350
  networkx.generators.internet_as_graphs.AS_graph_generator.choose_node_pref_attach:
  - 163
  - 164
  - 157
  networkx.generators.internet_as_graphs.AS_graph_generator.choose_peer_pref_attach:
  - 152
  - 145
  - 154
  networkx.generators.internet_as_graphs.AS_graph_generator.generate:
  - 384
  - 353
  - 385
  - 387
  - 388
  - 390
  - 391
  - 394
  - 395
  - 396
  - 375
  - 378
  - 380
  - 381
  - 383
  networkx.generators.internet_as_graphs.AS_graph_generator.graph_regions:
  - 322
  - 331
  - 332
  networkx.generators.internet_as_graphs.AS_graph_generator.t_graph:
  - 128
  - 129
  - 130
  - 131
  - 132
  - 133
  - 134
  - 117
  - 125
  - 126
  - 127
  networkx.generators.internet_as_graphs.choose_pref_attach:
  - 38
  - 56
  - 58
  - 59
  - 60
  - 61
  - 63
  networkx.generators.internet_as_graphs.random_internet_as_graph:
  - 441
  - 442
  - 404
  networkx.generators.internet_as_graphs.uniform_int_from_avg:
  - 10
  - 27
  - 28
  - 29
  networkx.generators.intersection:
  - 1
  - 15
  - 16
  - 51
  - 52
  - 87
  - 88
  networkx.generators.intersection.general_random_intersection_graph:
  - 122
  - 117
  - 119
  - 120
  - 121
  - 90
  - 123
  - 124
  - 125
  networkx.generators.intersection.k_random_intersection_graph:
  - 79
  - 80
  - 81
  - 82
  - 83
  - 84
  - 54
  networkx.generators.intersection.uniform_random_intersection_graph:
  - 48
  - 18
  - 47
  networkx.generators.interval_graph:
  - 1
  - 12
  networkx.generators.interval_graph.interval_graph:
  - 65
  - 66
  - 68
  - 69
  - 14
  - 49
  - 50
  - 51
  - 56
  - 59
  - 61
  - 62
  networkx.generators.joint_degree_seq:
  - 288
  - 1
  - 14
  - 144
  - 145
  - 471
  - 472
  networkx.generators.joint_degree_seq._directed_neighbor_switch:
  - 359
  - 392
  - 393
  - 395
  - 397
  - 399
  - 400
  - 402
  - 403
  - 405
  - 406
  - 407
  - 411
  - 412
  networkx.generators.joint_degree_seq._directed_neighbor_switch_rev:
  - 449
  - 450
  - 452
  - 453
  - 422
  - 455
  - 456
  - 457
  - 458
  - 459
  - 463
  - 464
  - 446
  - 447
  networkx.generators.joint_degree_seq._neighbor_switch:
  - 129
  - 130
  - 136
  - 137
  - 140
  - 141
  - 111
  - 113
  - 82
  - 121
  - 123
  - 124
  networkx.generators.joint_degree_seq.directed_joint_degree_graph:
  - 640
  - 641
  - 650
  - 654
  - 658
  - 660
  - 661
  - 662
  - 663
  - 537
  - 542
  - 560
  - 561
  - 562
  - 563
  - 564
  - 565
  - 566
  - 570
  - 572
  - 573
  - 574
  - 575
  - 576
  - 577
  - 578
  - 582
  - 586
  - 587
  - 588
  - 589
  - 593
  - 594
  - 597
  - 599
  - 474
  - 603
  - 604
  - 608
  - 612
  - 613
  - 622
  - 623
  - 626
  - 627
  - 636
  networkx.generators.joint_degree_seq.is_valid_directed_joint_degree:
  - 353
  - 290
  - 328
  - 331
  - 334
  - 335
  - 337
  - 340
  - 341
  - 343
  - 346
  - 347
  - 348
  - 350
  networkx.generators.joint_degree_seq.is_valid_joint_degree:
  - 64
  - 65
  - 68
  - 70
  - 71
  - 73
  - 16
  - 56
  - 57
  - 58
  - 59
  - 63
  networkx.generators.joint_degree_seq.joint_degree_graph:
  - 257
  - 258
  - 261
  - 263
  - 264
  - 267
  - 268
  - 269
  - 271
  - 147
  - 276
  - 281
  - 282
  - 283
  - 284
  - 203
  - 208
  - 211
  - 212
  - 222
  - 223
  - 224
  - 226
  - 230
  - 231
  - 236
  - 249
  networkx.generators.lattice:
  - 1
  - 35
  - 36
  - 199
  - 306
  - 95
  - 159
  networkx.generators.lattice.grid_2d_graph:
  - 69
  - 38
  - 72
  - 73
  - 74
  - 81
  - 84
  - 85
  - 88
  - 90
  - 91
  networkx.generators.lattice.grid_graph:
  - 97
  - 144
  - 145
  - 147
  - 150
  - 151
  - 152
  - 153
  - 155
  networkx.generators.lattice.hexagonal_lattice_graph:
  - 384
  - 385
  - 386
  - 387
  - 388
  - 389
  - 390
  - 393
  - 397
  - 398
  - 403
  - 404
  - 310
  - 363
  - 364
  - 366
  - 371
  - 372
  - 376
  - 377
  - 379
  - 380
  - 383
  networkx.generators.lattice.hypercube_graph:
  - 161
  - 195
  networkx.generators.lattice.triangular_lattice_graph:
  - 263
  - 264
  - 266
  - 267
  - 272
  - 273
  - 275
  - 276
  - 278
  - 279
  - 282
  - 283
  - 284
  - 285
  - 286
  - 287
  - 289
  - 292
  - 296
  - 297
  - 301
  - 302
  - 203
  networkx.generators.line:
  - 1
  - 14
  - 218
  - 219
  - 220
  networkx.generators.line._find_partition:
  - 385
  - 387
  - 389
  - 390
  - 392
  - 393
  - 394
  - 398
  - 399
  - 400
  - 369
  - 401
  - 407
  - 408
  networkx.generators.line._lg_directed:
  - 139
  - 142
  - 144
  - 146
  - 147
  - 148
  - 124
  networkx.generators.line._lg_undirected:
  - 192
  - 193
  - 197
  - 154
  - 199
  - 201
  - 206
  - 207
  - 177
  - 209
  - 180
  - 214
  - 186
  networkx.generators.line._odd_triangle:
  - 353
  - 354
  - 356
  - 357
  - 360
  - 329
  - 361
  - 362
  - 363
  - 365
  networkx.generators.line._select_starting_cell:
  - 414
  - 437
  - 438
  - 441
  - 443
  - 446
  - 447
  - 448
  - 451
  - 457
  - 458
  - 459
  - 460
  - 463
  - 465
  - 470
  - 471
  - 473
  - 474
  - 477
  - 479
  - 480
  - 481
  - 482
  - 484
  - 485
  - 486
  - 493
  networkx.generators.line._triangles:
  - 322
  - 323
  - 324
  - 315
  - 317
  - 319
  networkx.generators.line.inverse_line_graph:
  - 271
  - 272
  - 273
  - 274
  - 277
  - 279
  - 286
  - 293
  - 294
  - 297
  - 298
  - 301
  - 304
  - 305
  - 306
  - 307
  - 308
  - 309
  - 310
  - 222
  networkx.generators.line.line_graph:
  - 16
  - 116
  - 117
  - 119
  networkx.generators.mycielski:
  - 1
  - 71
  - 12
  - 13
  - 14
  networkx.generators.mycielski.mycielski_graph:
  - 103
  - 73
  - 106
  - 107
  - 110
  networkx.generators.mycielski.mycielskian:
  - 64
  - 65
  - 66
  - 16
  - 57
  - 59
  - 60
  - 61
  - 62
  - 63
  networkx.generators.nonisomorphic_trees:
  - 128
  - 1
  - 80
  - 17
  - 116
  networkx.generators.nonisomorphic_trees._layout_to_graph:
  - 257
  - 258
  - 244
  - 246
  - 248
  - 250
  - 254
  networkx.generators.nonisomorphic_trees._layout_to_matrix:
  - 224
  - 227
  - 229
  - 231
  - 235
  - 239
  networkx.generators.nonisomorphic_trees._next_rooted_tree:
  - 143
  - 145
  - 146
  - 149
  - 155
  - 156
  networkx.generators.nonisomorphic_trees._next_tree:
  - 192
  - 193
  - 162
  - 194
  - 195
  - 196
  - 168
  - 172
  - 173
  - 176
  - 179
  - 183
  - 186
  - 190
  - 191
  networkx.generators.nonisomorphic_trees._rooted_trees:
  - 130
  - 132
  - 135
  - 136
  - 137
  - 138
  networkx.generators.nonisomorphic_trees._split_tree:
  - 201
  - 207
  - 208
  - 209
  - 215
  - 216
  - 218
  - 219
  networkx.generators.nonisomorphic_trees._unlabeled_trees:
  - 118
  - 121
  - 122
  - 123
  - 124
  - 125
  networkx.generators.nonisomorphic_trees.nonisomorphic_trees:
  - 66
  - 67
  - 68
  - 71
  - 74
  - 75
  - 76
  - 77
  - 19
  - 61
  - 63
  networkx.generators.nonisomorphic_trees.number_of_nonisomorphic_trees:
  - 113
  - 82
  - 111
  networkx.generators.random_clustered:
  - 1
  - 10
  - 9
  networkx.generators.random_clustered.random_clustered_graph:
  - 98
  - 100
  - 101
  - 102
  - 103
  - 105
  - 12
  - 108
  - 109
  - 111
  - 113
  - 114
  - 115
  - 116
  - 89
  - 91
  - 92
  - 93
  networkx.generators.random_graphs:
  - 256
  - 1
  - 257
  - 1154
  - 388
  - 389
  - 1155
  - 524
  - 525
  - 659
  - 660
  - 1173
  - 1174
  - 41
  - 42
  - 1330
  - 1331
  - 313
  - 314
  - 191
  - 192
  - 840
  - 841
  - 1099
  - 1100
  - 468
  - 469
  - 1236
  - 1237
  - 735
  - 736
  - 1006
  - 1007
  - 122
  - 123
  - 1277
  - 1278
  networkx.generators.random_graphs._random_subset:
  - 645
  - 652
  - 653
  - 654
  - 655
  networkx.generators.random_graphs.barabasi_albert_graph:
  - 706
  - 708
  - 710
  - 714
  - 717
  - 719
  - 723
  - 725
  - 662
  - 727
  - 729
  - 700
  - 701
  networkx.generators.random_graphs.connected_watts_strogatz_graph:
  - 516
  - 519
  - 518
  - 471
  networkx.generators.random_graphs.dense_gnm_random_graph:
  - 194
  - 230
  - 232
  - 233
  - 234
  - 236
  - 244
  - 245
  - 247
  - 251
  networkx.generators.random_graphs.dual_barabasi_albert_graph:
  - 783
  - 784
  - 788
  - 792
  - 798
  - 799
  - 800
  - 801
  - 803
  - 805
  - 807
  - 812
  - 815
  - 817
  - 819
  - 822
  - 828
  - 830
  - 832
  - 834
  - 740
  networkx.generators.random_graphs.extended_barabasi_albert_graph:
  - 898
  - 903
  - 911
  - 916
  - 919
  - 920
  - 923
  - 925
  - 926
  - 928
  - 932
  - 933
  - 935
  - 939
  - 942
  - 943
  - 946
  - 947
  - 948
  - 949
  - 952
  - 956
  - 957
  - 959
  - 962
  - 965
  - 969
  - 970
  - 843
  - 974
  - 975
  - 978
  - 979
  - 983
  - 984
  - 985
  - 986
  - 987
  - 989
  - 990
  - 995
  - 996
  - 999
  - 1001
  - 894
  - 895
  networkx.generators.random_graphs.fast_gnp_random_graph:
  - 96
  - 100
  - 101
  - 105
  - 106
  - 44
  - 112
  - 113
  - 84
  - 117
  - 118
  - 87
  - 88
  - 92
  - 94
  networkx.generators.random_graphs.gnm_random_graph:
  - 289
  - 259
  - 292
  - 293
  - 295
  - 296
  - 298
  - 299
  - 303
  - 304
  - 305
  - 308
  networkx.generators.random_graphs.gnp_random_graph:
  - 169
  - 172
  - 173
  - 175
  - 176
  - 180
  - 181
  - 182
  - 125
  networkx.generators.random_graphs.newman_watts_strogatz_graph:
  - 384
  - 355
  - 356
  - 360
  - 361
  - 363
  - 364
  - 367
  - 369
  - 370
  - 373
  - 374
  - 375
  - 376
  - 380
  - 379
  - 316
  - 381
  networkx.generators.random_graphs.powerlaw_cluster_graph:
  - 1057
  - 1058
  - 1061
  - 1064
  - 1065
  - 1069
  - 1071
  - 1072
  - 1073
  - 1076
  - 1079
  - 1080
  - 1082
  - 1083
  - 1084
  - 1085
  - 1089
  - 1090
  - 1091
  - 1094
  - 1009
  networkx.generators.random_graphs.random_kernel_graph:
  - 1410
  - 1411
  - 1414
  - 1415
  - 1396
  - 1397
  - 1335
  - 1406
  - 1407
  networkx.generators.random_graphs.random_kernel_graph.kernel_root:
  - 1404
  networkx.generators.random_graphs.random_kernel_graph.kernel_root.my_function:
  - 1402
  networkx.generators.random_graphs.random_lobster:
  - 1170
  - 1157
  - 1165
  networkx.generators.random_graphs.random_lobster_graph:
  - 1133
  - 1134
  - 1102
  - 1135
  - 1139
  - 1140
  - 1143
  - 1144
  - 1146
  - 1148
  - 1150
  networkx.generators.random_graphs.random_powerlaw_tree:
  - 1272
  - 1273
  - 1270
  - 1239
  networkx.generators.random_graphs.random_powerlaw_tree_sequence:
  - 1280
  - 1314
  - 1316
  - 1318
  - 1319
  - 1320
  - 1322
  - 1323
  - 1309
  - 1311
  networkx.generators.random_graphs.random_regular_graph:
  - 577
  - 580
  - 582
  - 638
  - 527
  - 636
  - 573
  - 574
  - 639
  networkx.generators.random_graphs.random_regular_graph._suitable:
  - 588
  - 590
  - 591
  - 595
  - 598
  - 600
  networkx.generators.random_graphs.random_regular_graph._try_creation:
  - 608
  - 611
  - 612
  - 613
  - 614
  - 615
  - 617
  - 618
  - 623
  - 628
  - 629
  - 607
  networkx.generators.random_graphs.random_shell_graph:
  - 1217
  - 1220
  - 1221
  - 1222
  - 1226
  - 1227
  - 1228
  - 1231
  - 1201
  - 1202
  - 1176
  - 1209
  - 1210
  - 1211
  - 1212
  - 1208
  - 1215
  networkx.generators.random_graphs.watts_strogatz_graph:
  - 451
  - 454
  - 391
  - 455
  - 456
  - 458
  - 459
  - 460
  - 463
  - 464
  - 433
  - 434
  - 438
  - 439
  - 442
  - 443
  - 445
  - 447
  networkx.generators.small:
  - 1
  - 652
  - 525
  - 909
  - 274
  - 148
  - 789
  - 416
  - 682
  - 555
  - 305
  - 182
  - 66
  - 450
  - 967
  - 842
  - 334
  - 721
  - 602
  - 227
  - 998
  - 745
  - 875
  - 494
  - 369
  networkx.generators.small.LCF_graph:
  - 128
  - 131
  - 68
  - 134
  - 135
  - 138
  - 118
  - 119
  - 122
  - 123
  - 126
  networkx.generators.small._raise_on_directed:
  - 54
  - 46
  networkx.generators.small._raise_on_directed.wrapper:
  - 56
  - 57
  - 58
  - 59
  - 61
  networkx.generators.small.bull_graph:
  - 173
  - 150
  networkx.generators.small.chvatal_graph:
  - 184
  - 207
  networkx.generators.small.cubical_graph:
  - 257
  - 229
  networkx.generators.small.desargues_graph:
  - 299
  - 276
  networkx.generators.small.diamond_graph:
  - 307
  - 327
  networkx.generators.small.dodecahedral_graph:
  - 336
  - 364
  networkx.generators.small.frucht_graph:
  - 396
  - 371
  - 395
  networkx.generators.small.generalized_petersen_graph:
  - 832
  - 834
  - 835
  - 836
  - 791
  - 826
  - 828
  - 831
  networkx.generators.small.heawood_graph:
  - 418
  - 445
  networkx.generators.small.hoffman_singleton_graph:
  - 480
  - 481
  - 482
  - 483
  - 452
  - 484
  - 485
  - 486
  - 487
  - 488
  - 479
  networkx.generators.small.house_graph:
  - 496
  - 516
  networkx.generators.small.house_x_graph:
  - 548
  - 549
  - 527
  networkx.generators.small.icosahedral_graph:
  - 557
  - 582
  networkx.generators.small.krackhardt_kite_graph:
  - 633
  - 604
  networkx.generators.small.moebius_kantor_graph:
  - 676
  - 654
  networkx.generators.small.octahedral_graph:
  - 713
  - 684
  networkx.generators.small.pappus_graph:
  - 723
  - 739
  networkx.generators.small.petersen_graph:
  - 770
  - 747
  networkx.generators.small.sedgewick_maze_graph:
  - 865
  - 866
  - 867
  - 868
  - 869
  - 870
  - 844
  networkx.generators.small.tetrahedral_graph:
  - 877
  - 903
  networkx.generators.small.truncated_cube_graph:
  - 935
  - 911
  networkx.generators.small.truncated_tetrahedron_graph:
  - 992
  - 969
  - 991
  networkx.generators.small.tutte_graph:
  - 1000
  - 1024
  networkx.generators.social:
  - 1
  - 289
  - 104
  - 15
  - 255
  networkx.generators.social.davis_southern_women_graph:
  - 137
  - 106
  - 115
  - 155
  - 157
  networkx.generators.social.florentine_families_graph:
  - 257
  - 265
  - 266
  - 267
  - 268
  - 269
  - 270
  - 271
  - 272
  - 273
  - 274
  - 275
  - 276
  - 277
  - 278
  - 279
  - 280
  - 281
  - 282
  - 283
  - 284
  - 285
  networkx.generators.social.karate_club_graph:
  - 96
  - 99
  - 48
  - 17
  - 52
  - 53
  - 92
  - 93
  - 94
  - 95
  networkx.generators.social.les_miserables_graph:
  - 512
  - 513
  - 514
  - 515
  - 516
  - 517
  - 518
  - 519
  - 520
  - 521
  - 522
  - 523
  - 524
  - 525
  - 526
  - 527
  - 528
  - 529
  - 530
  - 531
  - 532
  - 533
  - 534
  - 535
  - 536
  - 537
  - 538
  - 539
  - 540
  - 541
  - 542
  - 543
  - 544
  - 545
  - 546
  - 547
  - 548
  - 549
  - 550
  - 551
  - 552
  - 553
  - 291
  - 299
  - 300
  - 301
  - 302
  - 303
  - 304
  - 305
  - 306
  - 307
  - 308
  - 309
  - 310
  - 311
  - 312
  - 313
  - 314
  - 315
  - 316
  - 317
  - 318
  - 319
  - 320
  - 321
  - 322
  - 323
  - 324
  - 325
  - 326
  - 327
  - 328
  - 329
  - 330
  - 331
  - 332
  - 333
  - 334
  - 335
  - 336
  - 337
  - 338
  - 339
  - 340
  - 341
  - 342
  - 343
  - 344
  - 345
  - 346
  - 347
  - 348
  - 349
  - 350
  - 351
  - 352
  - 353
  - 354
  - 355
  - 356
  - 357
  - 358
  - 359
  - 360
  - 361
  - 362
  - 363
  - 364
  - 365
  - 366
  - 367
  - 368
  - 369
  - 370
  - 371
  - 372
  - 373
  - 374
  - 375
  - 376
  - 377
  - 378
  - 379
  - 380
  - 381
  - 382
  - 383
  - 384
  - 385
  - 386
  - 387
  - 388
  - 389
  - 390
  - 391
  - 392
  - 393
  - 394
  - 395
  - 396
  - 397
  - 398
  - 399
  - 400
  - 401
  - 402
  - 403
  - 404
  - 405
  - 406
  - 407
  - 408
  - 409
  - 410
  - 411
  - 412
  - 413
  - 414
  - 415
  - 416
  - 417
  - 418
  - 419
  - 420
  - 421
  - 422
  - 423
  - 424
  - 425
  - 426
  - 427
  - 428
  - 429
  - 430
  - 431
  - 432
  - 433
  - 434
  - 435
  - 436
  - 437
  - 438
  - 439
  - 440
  - 441
  - 442
  - 443
  - 444
  - 445
  - 446
  - 447
  - 448
  - 449
  - 450
  - 451
  - 452
  - 453
  - 454
  - 455
  - 456
  - 457
  - 458
  - 459
  - 460
  - 461
  - 462
  - 463
  - 464
  - 465
  - 466
  - 467
  - 468
  - 469
  - 470
  - 471
  - 472
  - 473
  - 474
  - 475
  - 476
  - 477
  - 478
  - 479
  - 480
  - 481
  - 482
  - 483
  - 484
  - 485
  - 486
  - 487
  - 488
  - 489
  - 490
  - 491
  - 492
  - 493
  - 494
  - 495
  - 496
  - 497
  - 498
  - 499
  - 500
  - 501
  - 502
  - 503
  - 504
  - 505
  - 506
  - 507
  - 508
  - 509
  - 510
  - 511
  networkx.generators.spectral_graph_forge:
  - 1
  - 10
  - 9
  networkx.generators.spectral_graph_forge.spectral_graph_forge:
  - 12
  - 86
  - 87
  - 89
  - 91
  - 96
  - 99
  - 100
  - 103
  - 104
  - 105
  - 106
  - 108
  - 109
  - 111
  - 112
  - 114
  - 115
  - 116
  - 118
  networkx.generators.stochastic:
  - 1
  - 13
  - 14
  networkx.generators.stochastic.stochastic_graph:
  - 42
  - 43
  - 47
  - 48
  - 49
  - 18
  - 52
  - 53
  networkx.generators.sudoku:
  - 1
  - 50
  networkx.generators.sudoku.sudoku_graph:
  - 129
  - 126
  - 102
  - 105
  - 109
  - 111
  - 112
  - 113
  - 52
  - 116
  - 117
  - 118
  - 119
  - 122
  - 123
  - 125
  - 94
  networkx.generators.time_series:
  - 1
  - 12
  networkx.generators.time_series.visibility_graph:
  - 66
  - 68
  - 71
  - 72
  - 14
  - 57
  - 58
  - 61
  networkx.generators.trees:
  - 416
  - 1
  - 324
  - 325
  - 838
  - 839
  - 653
  - 654
  - 49
  - 182
  - 1015
  - 1016
  - 378
  - 379
  - 415
  networkx.generators.trees._bicenter:
  - 963
  - 964
  - 967
  - 968
  - 969
  - 939
  networkx.generators.trees._num_rooted_forests:
  - 739
  - 740
  - 741
  - 742
  - 711
  - 745
  - 746
  networkx.generators.trees._num_rooted_trees:
  - 549
  - 550
  - 551
  - 554
  - 555
  - 532
  networkx.generators.trees._num_trees:
  - 929
  - 930
  - 933
  - 934
  - 911
  - 927
  networkx.generators.trees._random_unlabeled_rooted_forest:
  - 795
  - 832
  - 833
  - 823
  - 826
  - 827
  - 830
  - 831
  networkx.generators.trees._random_unlabeled_rooted_tree:
  - 641
  - 642
  - 643
  - 605
  - 644
  - 645
  - 646
  - 647
  - 634
  - 637
  networkx.generators.trees._random_unlabeled_tree:
  - 1000
  - 1003
  - 1004
  - 1005
  - 974
  - 1007
  - 1010
  - 1011
  networkx.generators.trees._select_jd_forests:
  - 781
  - 783
  - 784
  - 787
  - 756
  - 788
  - 790
  networkx.generators.trees._select_jd_trees:
  - 591
  - 593
  - 594
  - 564
  - 597
  - 598
  - 600
  networkx.generators.trees._to_nx:
  - 522
  - 523
  - 524
  - 526
  - 500
  networkx.generators.trees.prefix_tree:
  - 160
  - 161
  - 162
  - 166
  - 169
  - 172
  - 174
  - 175
  - 176
  - 177
  - 51
  - 156
  - 158
  networkx.generators.trees.prefix_tree.get_children:
  - 142
  - 145
  - 147
  - 148
  - 152
  networkx.generators.trees.prefix_tree_recursive:
  - 320
  - 184
  - 314
  - 316
  - 318
  networkx.generators.trees.prefix_tree_recursive._helper:
  - 295
  - 296
  - 298
  - 299
  - 303
  - 305
  - 307
  - 309
  - 278
  - 310
  - 311
  networkx.generators.trees.random_labeled_rooted_forest:
  - 480
  - 418
  - 483
  - 484
  - 486
  - 489
  - 491
  - 492
  - 461
  - 462
  - 466
  - 467
  - 468
  - 471
  - 473
  - 475
  - 477
  - 479
  networkx.generators.trees.random_labeled_rooted_forest._select_k:
  - 450
  - 452
  - 453
  - 454
  - 456
  networkx.generators.trees.random_labeled_rooted_tree:
  - 410
  - 411
  - 381
  networkx.generators.trees.random_labeled_tree:
  - 327
  - 371
  - 373
  - 374
  - 375
  networkx.generators.trees.random_unlabeled_rooted_forest:
  - 896
  - 899
  - 902
  - 903
  - 841
  - 906
  - 887
  - 889
  - 895
  networkx.generators.trees.random_unlabeled_rooted_tree:
  - 705
  - 706
  - 656
  - 699
  - 702
  - 703
  networkx.generators.trees.random_unlabeled_tree:
  - 1059
  - 1064
  - 1065
  - 1068
  - 1069
  - 1018
  networkx.generators.triads:
  - 37
  - 5
  networkx.generators.triads.triad_graph:
  - 39
  - 86
  - 91
  - 92
  - 93
  networkx.lazy_imports.DelayedImportErrorModule.__getattr__:
  - 88
  - 89
  networkx.lazy_imports.DelayedImportErrorModule.__init__:
  - 85
  networkx.lazy_imports._lazy_import:
  - 101
  - 166
  - 168
  - 170
  - 178
  - 182
  - 185
  - 186
  networkx.lazy_imports.attach:
  - 75
  - 12
  - 76
  - 77
  - 79
  - 49
  - 52
  - 53
  - 55
  - 58
  - 61
  networkx.lazy_imports.attach.__getattr__:
  - 64
  - 65
  - 66
  - 67
  - 68
  networkx.linalg.algebraicconnectivity:
  - 1
  - 585
  - 403
  - 307
  - 308
  - 309
  - 404
  - 405
  - 501
  - 502
  networkx.linalg.algebraicconnectivity._LUSolver:
  - 78
  networkx.linalg.algebraicconnectivity._LUSolver.__init__:
  - 91
  networkx.linalg.algebraicconnectivity._LUSolver.solve:
  - 104
  - 101
  - 102
  - 103
  networkx.linalg.algebraicconnectivity._PCGSolver:
  - 21
  networkx.linalg.algebraicconnectivity._PCGSolver._solve:
  - 65
  - 66
  - 67
  - 68
  - 69
  - 71
  - 72
  - 74
  - 56
  - 58
  - 59
  - 60
  - 61
  - 62
  networkx.linalg.algebraicconnectivity._PCGSolver.solve:
  - 44
  - 45
  - 46
  - 47
  networkx.linalg.algebraicconnectivity._get_fiedler_func:
  - 257
  - 260
  - 262
  - 270
  networkx.linalg.algebraicconnectivity._get_fiedler_func.find_fiedler:
  - 291
  - 292
  - 293
  - 294
  - 295
  - 296
  - 265
  - 266
  - 267
  - 297
  - 275
  - 277
  - 278
  - 279
  - 282
  - 286
  networkx.linalg.algebraicconnectivity._preprocess_graph:
  - 128
  - 129
  - 130
  - 109
  - 110
  - 111
  - 112
  - 113
  - 114
  - 118
  - 120
  - 124
  - 125
  networkx.linalg.algebraicconnectivity._rcm_estimate:
  - 135
  - 138
  - 139
  - 140
  - 141
  - 142
  - 143
  networkx.linalg.algebraicconnectivity._tracemin_fiedler:
  - 150
  - 188
  - 191
  - 192
  - 194
  - 196
  - 212
  - 213
  - 214
  - 215
  - 217
  - 222
  - 224
  - 229
  - 230
  - 231
  - 235
  - 239
  - 243
  - 244
  - 249
  - 250
  - 251
  - 253
  networkx.linalg.algebraicconnectivity._tracemin_fiedler.project:
  - 199
  - 200
  - 201
  - 207
  - 208
  - 209
  - 210
  networkx.linalg.algebraicconnectivity.algebraic_connectivity:
  - 387
  - 389
  - 390
  - 393
  - 394
  - 395
  - 397
  - 398
  - 399
  - 400
  - 313
  networkx.linalg.algebraicconnectivity.fiedler_vector:
  - 485
  - 487
  - 488
  - 491
  - 492
  - 494
  - 495
  - 496
  - 497
  - 409
  networkx.linalg.algebraicconnectivity.spectral_bisection:
  - 650
  - 589
  - 646
  - 647
  networkx.linalg.algebraicconnectivity.spectral_ordering:
  - 576
  - 577
  - 578
  - 580
  - 565
  - 567
  - 569
  - 506
  - 571
  - 572
  - 573
  - 574
  - 575
  networkx.linalg.attrmatrix:
  - 1
  - 146
  - 311
  networkx.linalg.attrmatrix._edge_value:
  - 99
  - 102
  - 104
  - 116
  - 86
  - 56
  - 89
  networkx.linalg.attrmatrix._edge_value.value:
  - 112
  - 107
  - 92
  - 119
  networkx.linalg.attrmatrix._node_value:
  - 34
  - 11
  - 39
  networkx.linalg.attrmatrix.attr_matrix:
  - 276
  - 277
  - 279
  - 280
  - 284
  - 156
  - 285
  - 286
  - 287
  - 289
  - 290
  - 291
  - 293
  - 294
  - 295
  - 296
  - 299
  - 300
  - 302
  - 303
  - 305
  networkx.linalg.attrmatrix.attr_sparse_matrix:
  - 434
  - 435
  - 437
  - 438
  - 442
  - 443
  - 315
  - 444
  - 445
  - 447
  - 448
  - 449
  - 451
  - 452
  - 453
  - 454
  - 457
  - 458
  - 460
  - 461
  - 463
  networkx.linalg.bethehessianmatrix:
  - 1
  - 10
  - 9
  networkx.linalg.bethehessianmatrix.bethe_hessian_matrix:
  - 69
  - 70
  - 71
  - 72
  - 73
  - 75
  - 76
  - 13
  networkx.linalg.graphmatrix:
  - 1
  - 10
  - 108
  networkx.linalg.graphmatrix.adjacency_matrix:
  - 168
  - 110
  networkx.linalg.graphmatrix.incidence_matrix:
  - 96
  - 98
  - 99
  - 71
  - 72
  - 73
  - 74
  - 75
  - 105
  - 77
  - 14
  - 78
  - 79
  - 80
  - 82
  - 91
  - 94
  networkx.linalg.laplacianmatrix:
  - 1
  - 132
  - 22
  - 348
  - 250
  - 251
  - 252
  - 349
  - 350
  networkx.linalg.laplacianmatrix._transition_matrix:
  - 480
  - 481
  - 482
  - 489
  - 491
  - 492
  - 493
  - 496
  - 499
  - 500
  - 437
  - 503
  - 505
  - 507
  networkx.linalg.laplacianmatrix.directed_combinatorial_laplacian_matrix:
  - 354
  - 421
  - 427
  - 428
  - 429
  - 431
  networkx.linalg.laplacianmatrix.directed_laplacian_matrix:
  - 256
  - 326
  - 332
  - 333
  - 334
  - 336
  - 338
  - 340
  - 343
  networkx.linalg.laplacianmatrix.laplacian_matrix:
  - 128
  - 24
  - 124
  - 125
  - 126
  networkx.linalg.laplacianmatrix.normalized_laplacian_matrix:
  - 134
  - 232
  - 233
  - 234
  - 236
  - 237
  - 239
  - 240
  - 241
  - 242
  networkx.linalg.modularitymatrix:
  - 1
  - 9
  - 10
  - 11
  - 78
  - 79
  - 80
  networkx.linalg.modularitymatrix.directed_modularity_matrix:
  - 160
  - 161
  - 162
  - 164
  - 82
  - 157
  - 158
  - 159
  networkx.linalg.modularitymatrix.modularity_matrix:
  - 67
  - 68
  - 69
  - 70
  - 71
  - 73
  - 13
  networkx.linalg.spectrum:
  - 16
  - 1
  - 60
  - 94
  networkx.linalg.spectrum.adjacency_spectrum:
  - 96
  - 123
  networkx.linalg.spectrum.bethe_hessian_spectrum:
  - 186
  - 159
  networkx.linalg.spectrum.laplacian_spectrum:
  - 57
  - 18
  networkx.linalg.spectrum.modularity_spectrum:
  - 128
  - 154
  - 152
  - 151
  networkx.linalg.spectrum.normalized_laplacian_spectrum:
  - 89
  - 90
  - 62
  networkx.readwrite:
  - 1
  networkx.readwrite.adjlist:
  - 1
  - 109
  - 173
  - 246
  - 247
  networkx.readwrite.adjlist.generate_adjlist:
  - 32
  - 96
  - 97
  - 98
  - 100
  - 101
  - 103
  - 104
  - 105
  - 106
  - 92
  - 93
  - 94
  - 95
  networkx.readwrite.adjlist.parse_adjlist:
  - 224
  - 225
  - 227
  - 229
  - 234
  - 235
  - 237
  - 177
  - 242
  - 217
  - 218
  - 219
  - 220
  - 222
  networkx.readwrite.adjlist.read_adjlist:
  - 256
  - 323
  - 324
  networkx.readwrite.adjlist.write_adjlist:
  - 162
  - 166
  - 168
  - 170
  - 111
  - 158
  networkx.readwrite.edgelist:
  - 1
  - 300
  - 301
  - 428
  - 176
  - 126
  networkx.readwrite.edgelist.generate_edgelist:
  - 108
  - 44
  - 109
  - 110
  - 111
  - 112
  - 113
  - 115
  - 117
  - 120
  - 123
  networkx.readwrite.edgelist.parse_edgelist:
  - 256
  - 258
  - 259
  - 265
  - 268
  - 271
  - 272
  - 274
  - 275
  - 282
  - 287
  - 289
  - 295
  - 296
  - 180
  - 241
  - 242
  - 243
  - 244
  - 245
  - 247
  - 250
  - 251
  - 253
  - 254
  networkx.readwrite.edgelist.read_edgelist:
  - 312
  - 377
  - 378
  networkx.readwrite.edgelist.read_weighted_edgelist:
  - 481
  - 437
  networkx.readwrite.edgelist.write_edgelist:
  - 128
  - 171
  - 173
  networkx.readwrite.edgelist.write_weighted_edgelist:
  - 418
  - 389
  networkx.readwrite.gexf:
  - 144
  - 1
  - 145
  - 36
  networkx.readwrite.gexf.GEXF:
  - 195
  - 219
  - 207
  networkx.readwrite.gexf.GEXF.construct_types:
  - 268
  - 269
  networkx.readwrite.gexf.GEXF.set_version:
  - 284
  - 285
  networkx.readwrite.gexf.GEXFReader.__call__:
  - 718
  - 719
  - 720
  - 721
  - 723
  - 724
  - 725
  - 726
  - 727
  networkx.readwrite.gexf.GEXFReader.__init__:
  - 715
  - 711
  networkx.readwrite.gexf.GEXFReader.add_edge:
  - 934
  - 935
  - 937
  - 941
  - 942
  - 943
  - 944
  - 945
  - 947
  - 948
  - 950
  - 951
  - 953
  - 958
  - 959
  - 963
  - 964
  - 967
  - 968
  - 969
  - 971
  - 972
  - 975
  - 978
  - 979
  - 980
  networkx.readwrite.gexf.GEXFReader.add_node:
  - 832
  - 833
  - 837
  - 838
  - 839
  - 840
  - 842
  - 813
  - 814
  - 815
  - 816
  - 818
  - 819
  - 820
  - 823
  - 824
  - 825
  - 828
  networkx.readwrite.gexf.GEXFReader.add_parents:
  - 901
  - 902
  - 904
  - 905
  - 906
  networkx.readwrite.gexf.GEXFReader.add_slices:
  - 910
  - 911
  - 913
  - 914
  - 915
  - 916
  networkx.readwrite.gexf.GEXFReader.add_spells:
  - 920
  - 921
  - 924
  - 925
  - 926
  - 927
  networkx.readwrite.gexf.GEXFReader.add_start_end:
  - 847
  - 848
  - 849
  - 850
  - 851
  - 852
  networkx.readwrite.gexf.GEXFReader.add_viz:
  - 896
  - 858
  - 859
  - 860
  - 862
  - 863
  - 864
  - 868
  - 869
  - 870
  - 871
  - 874
  - 875
  - 876
  - 878
  - 879
  - 880
  - 882
  - 883
  - 884
  - 885
  - 886
  - 888
  - 889
  - 891
  - 892
  - 893
  networkx.readwrite.gexf.GEXFReader.decode_attr_elements:
  - 996
  - 997
  - 1000
  - 1001
  - 1005
  - 1006
  - 1007
  - 1008
  - 986
  - 987
  - 989
  - 990
  networkx.readwrite.gexf.GEXFReader.find_gexf_attributes:
  - 1024
  - 1027
  - 1028
  - 1029
  - 1032
  - 1020
  - 1021
  - 1022
  - 1023
  networkx.readwrite.gexf.GEXFReader.make_graph:
  - 768
  - 769
  - 770
  - 771
  - 773
  - 774
  - 775
  - 776
  - 785
  - 786
  - 790
  - 791
  - 792
  - 793
  - 796
  - 797
  - 798
  - 799
  - 802
  - 803
  - 804
  - 806
  - 732
  - 733
  - 734
  - 736
  - 739
  - 740
  - 742
  - 743
  - 745
  - 746
  - 748
  - 749
  - 755
  - 756
  - 760
  - 766
  - 767
  networkx.readwrite.gexf.GEXFWriter.__init__:
  - 320
  - 321
  - 323
  - 326
  - 327
  - 328
  - 301
  - 304
  - 305
  - 338
  - 339
  - 317
  - 319
  networkx.readwrite.gexf.GEXFWriter.__str__:
  - 344
  - 342
  - 343
  networkx.readwrite.gexf.GEXFWriter.add_attributes:
  - 512
  - 514
  - 515
  - 516
  - 517
  - 518
  - 522
  - 523
  - 525
  - 527
  - 528
  - 530
  - 532
  - 533
  - 535
  - 537
  - 539
  - 540
  - 479
  - 480
  - 483
  - 485
  - 487
  - 488
  - 490
  - 492
  - 493
  - 494
  - 496
  - 497
  - 499
  - 500
  - 502
  - 503
  - 505
  - 507
  - 508
  - 510
  networkx.readwrite.gexf.GEXFWriter.add_edges:
  - 434
  - 435
  - 436
  - 438
  - 439
  - 443
  - 444
  - 448
  - 449
  - 453
  - 454
  - 455
  - 459
  - 460
  - 461
  - 464
  - 465
  - 466
  - 467
  - 468
  - 469
  - 471
  - 472
  - 473
  - 474
  - 475
  networkx.readwrite.gexf.GEXFWriter.add_edges.edge_key_data:
  - 412
  - 413
  - 414
  - 415
  - 416
  - 417
  - 418
  - 419
  - 420
  - 421
  - 422
  - 424
  - 425
  - 426
  - 427
  - 428
  - 429
  - 430
  - 431
  - 432
  networkx.readwrite.gexf.GEXFWriter.add_graph:
  - 352
  - 354
  - 359
  - 363
  - 364
  - 366
  - 367
  - 368
  - 349
  - 350
  - 351
  networkx.readwrite.gexf.GEXFWriter.add_nodes:
  - 384
  - 385
  - 386
  - 390
  - 391
  - 392
  - 396
  - 398
  - 399
  - 400
  - 401
  - 403
  - 404
  - 405
  - 406
  - 407
  - 371
  - 372
  - 373
  - 374
  - 376
  - 379
  - 380
  networkx.readwrite.gexf.GEXFWriter.add_parents:
  - 629
  - 630
  - 631
  - 632
  - 633
  - 634
  - 635
  - 636
  networkx.readwrite.gexf.GEXFWriter.add_slices:
  - 640
  - 641
  - 642
  - 643
  - 644
  - 645
  - 646
  networkx.readwrite.gexf.GEXFWriter.add_spells:
  - 650
  - 651
  - 652
  - 653
  - 654
  - 655
  - 656
  - 657
  - 658
  - 659
  - 660
  - 661
  - 662
  networkx.readwrite.gexf.GEXFWriter.add_viz:
  - 576
  - 577
  - 578
  - 579
  - 580
  - 581
  - 583
  - 584
  - 585
  - 588
  - 590
  - 591
  - 592
  - 593
  - 595
  - 597
  - 598
  - 599
  - 600
  - 602
  - 603
  - 604
  - 605
  - 607
  - 608
  - 609
  - 610
  - 611
  - 614
  - 615
  - 617
  - 618
  - 619
  - 621
  - 622
  - 623
  - 625
  networkx.readwrite.gexf.GEXFWriter.alter_graph_mode_timeformat:
  - 672
  - 678
  - 680
  - 681
  - 667
  - 668
  - 670
  networkx.readwrite.gexf.GEXFWriter.get_attr_id:
  - 549
  - 552
  - 554
  - 555
  - 556
  - 557
  - 558
  - 561
  - 563
  - 564
  - 565
  - 567
  - 570
  - 571
  - 572
  networkx.readwrite.gexf.GEXFWriter.indent:
  - 693
  - 694
  - 696
  - 698
  - 699
  - 700
  - 703
  networkx.readwrite.gexf.GEXFWriter.write:
  - 688
  - 685
  - 686
  - 687
  networkx.readwrite.gexf.generate_gexf:
  - 140
  - 139
  - 100
  - 141
  networkx.readwrite.gexf.read_gexf:
  - 147
  - 181
  - 182
  - 183
  - 185
  networkx.readwrite.gexf.relabel_gexf_graph:
  - 1068
  - 1069
  - 1038
  - 1073
  - 1074
  - 1076
  - 1079
  - 1080
  - 1082
  networkx.readwrite.gexf.write_gexf:
  - 96
  - 94
  - 38
  - 95
  networkx.readwrite.gml:
  - 1
  - 199
  - 817
  - 114
  - 115
  networkx.readwrite.gml.Pattern:
  - 278
  networkx.readwrite.gml.escape:
  - 57
  - 58
  - 47
  networkx.readwrite.gml.escape.fixup:
  - 54
  - 55
  networkx.readwrite.gml.generate_gml:
  - 776
  - 777
  - 780
  - 781
  - 782
  - 783
  - 785
  - 786
  - 789
  - 791
  - 792
  - 793
  - 794
  - 795
  - 796
  - 797
  - 802
  - 803
  - 805
  - 806
  - 807
  - 808
  - 809
  - 810
  - 811
  - 812
  - 813
  - 814
  - 709
  - 627
  networkx.readwrite.gml.generate_gml.stringize:
  - 772
  - 774
  - 712
  - 714
  - 716
  - 717
  - 718
  - 719
  - 720
  - 721
  - 722
  - 724
  - 725
  - 726
  - 728
  - 729
  - 731
  - 732
  - 733
  - 736
  - 742
  - 743
  - 745
  - 746
  - 748
  - 749
  - 750
  - 752
  - 753
  - 754
  - 755
  - 756
  - 757
  - 758
  - 759
  - 760
  - 761
  - 762
  - 763
  - 765
  - 767
  networkx.readwrite.gml.literal_destringizer:
  - 104
  - 107
  - 87
  networkx.readwrite.gml.literal_stringizer:
  - 622
  - 621
  - 526
  - 623
  networkx.readwrite.gml.literal_stringizer.stringize:
  - 551
  - 552
  - 553
  - 554
  - 555
  - 557
  - 558
  - 559
  - 560
  - 562
  - 565
  - 566
  - 567
  - 568
  - 569
  - 571
  - 572
  - 573
  - 576
  - 577
  - 578
  - 579
  - 580
  - 582
  - 583
  - 584
  - 587
  - 588
  - 589
  - 590
  - 591
  - 592
  - 594
  - 595
  - 596
  - 598
  - 599
  - 600
  - 603
  - 604
  - 605
  - 606
  - 607
  - 608
  - 610
  - 611
  - 612
  - 615
  - 616
  networkx.readwrite.gml.parse_gml:
  - 201
  - 273
  networkx.readwrite.gml.parse_gml.decode_line:
  - 256
  - 250
  - 252
  - 255
  networkx.readwrite.gml.parse_gml.filter_lines:
  - 260
  - 261
  - 262
  - 263
  - 265
  - 266
  - 267
  - 269
  - 271
  networkx.readwrite.gml.parse_gml_lines:
  - 512
  - 513
  - 518
  - 520
  - 521
  - 300
  - 463
  - 464
  - 466
  - 467
  - 468
  - 469
  - 471
  - 472
  - 473
  - 481
  - 483
  - 484
  - 485
  - 486
  - 488
  - 489
  - 490
  - 492
  - 494
  - 496
  - 497
  - 498
  - 499
  - 500
  - 502
  - 504
  - 505
  - 506
  networkx.readwrite.gml.parse_gml_lines.consume:
  - 372
  - 373
  - 374
  networkx.readwrite.gml.parse_gml_lines.parse_dict:
  - 449
  - 445
  - 447
  networkx.readwrite.gml.parse_gml_lines.parse_graph:
  - 453
  - 454
  - 455
  - 456
  - 459
  networkx.readwrite.gml.parse_gml_lines.parse_kv:
  - 384
  - 385
  - 386
  - 387
  - 389
  - 393
  - 395
  - 397
  - 398
  - 399
  - 402
  - 405
  - 406
  - 408
  - 411
  - 417
  - 424
  - 425
  - 426
  - 428
  - 429
  - 440
  - 377
  - 380
  - 382
  networkx.readwrite.gml.parse_gml_lines.parse_kv.clean_dict_value:
  - 432
  - 434
  - 436
  networkx.readwrite.gml.parse_gml_lines.pop_attr:
  - 477
  networkx.readwrite.gml.parse_gml_lines.tokenize:
  - 313
  - 316
  - 322
  - 323
  - 324
  - 327
  - 333
  - 334
  - 337
  - 341
  - 344
  - 345
  - 348
  - 349
  - 350
  - 351
  - 352
  - 353
  - 354
  - 355
  - 356
  - 359
  - 360
  - 361
  - 364
  networkx.readwrite.gml.parse_gml_lines.unexpected:
  - 368
  networkx.readwrite.gml.read_gml:
  - 195
  - 117
  networkx.readwrite.gml.read_gml.filter_lines:
  - 193
  - 184
  - 186
  - 189
  - 190
  - 191
  networkx.readwrite.gml.unescape:
  - 83
  - 62
  networkx.readwrite.gml.unescape.fixup:
  - 65
  - 66
  - 68
  - 69
  - 71
  - 79
  networkx.readwrite.gml.write_gml:
  - 819
  - 878
  - 879
  networkx.readwrite.graph6:
  - 64
  - 322
  - 3
  - 195
  - 196
  - 260
  - 261
  - 262
  - 323
  - 141
  - 142
  networkx.readwrite.graph6._generate_graph6_bytes:
  - 58
  - 44
  - 45
  - 49
  - 50
  - 51
  - 52
  - 55
  - 24
  - 56
  - 59
  - 60
  - 61
  networkx.readwrite.graph6.data_to_n:
  - 392
  - 394
  - 388
  networkx.readwrite.graph6.from_graph6_bytes:
  - 66
  - 132
  - 133
  - 134
  - 135
  - 136
  - 116
  - 118
  - 122
  - 125
  - 127
  networkx.readwrite.graph6.from_graph6_bytes.bits:
  - 112
  - 113
  - 109
  - 111
  networkx.readwrite.graph6.n_to_data:
  - 408
  - 413
  - 415
  networkx.readwrite.graph6.read_graph6:
  - 198
  - 249
  - 250
  - 251
  - 253
  - 254
  networkx.readwrite.graph6.to_graph6_bytes:
  - 192
  - 144
  - 188
  - 189
  - 190
  - 191
  networkx.readwrite.graph6.write_graph6:
  - 264
  - 319
  networkx.readwrite.graph6.write_graph6_file:
  - 384
  - 325
  - 379
  - 380
  - 381
  - 382
  - 383
  networkx.readwrite.graphml:
  - 1
  - 236
  - 237
  - 117
  - 310
  - 62
  networkx.readwrite.graphml.GraphML:
  - 389
  networkx.readwrite.graphml.GraphML.construct_types:
  - 433
  - 434
  networkx.readwrite.graphml.GraphML.get_xml_type:
  - 452
  networkx.readwrite.graphml.GraphMLReader:
  - 840
  networkx.readwrite.graphml.GraphMLReader.__call__:
  - 852
  - 853
  - 854
  - 855
  - 858
  - 859
  - 860
  networkx.readwrite.graphml.GraphMLReader.__init__:
  - 843
  networkx.readwrite.graphml.GraphMLReader.add_edge:
  - 928
  - 929
  - 932
  - 936
  - 937
  - 938
  - 953
  - 942
  - 943
  - 947
  - 951
  - 921
  - 923
  - 924
  - 925
  - 959
  networkx.readwrite.graphml.GraphMLReader.add_node:
  - 905
  - 907
  - 908
  - 909
  - 911
  - 913
  - 914
  - 916
  - 917
  - 918
  networkx.readwrite.graphml.GraphMLReader.decode_data_elements:
  - 962
  - 964
  - 965
  - 973
  - 974
  - 978
  - 980
  - 981
  - 985
  - 986
  - 987
  - 988
  - 990
  - 991
  - 992
  - 993
  - 994
  - 995
  - 996
  - 997
  - 998
  - 999
  - 1003
  - 1011
  - 1012
  - 1014
  - 1016
  networkx.readwrite.graphml.GraphMLReader.find_graphml_keys:
  - 1024
  - 1025
  - 1026
  - 1027
  - 1028
  - 1029
  - 1032
  - 1034
  - 1035
  - 1040
  - 1043
  - 1044
  - 1047
  - 1049
  - 1052
  - 1021
  networkx.readwrite.graphml.GraphMLReader.make_graph:
  - 896
  - 899
  - 901
  - 864
  - 865
  - 866
  - 867
  - 869
  - 873
  - 877
  - 878
  - 879
  - 880
  - 882
  - 883
  - 886
  - 887
  - 889
  - 890
  - 892
  - 893
  networkx.readwrite.graphml.GraphMLWriter.__init__:
  - 483
  - 492
  - 493
  - 495
  - 496
  - 473
  networkx.readwrite.graphml.GraphMLWriter.__str__:
  - 501
  - 502
  - 503
  networkx.readwrite.graphml.GraphMLWriter.add_attributes:
  - 576
  - 577
  - 572
  - 575
  networkx.readwrite.graphml.GraphMLWriter.add_data:
  - 558
  - 562
  - 566
  - 567
  - 568
  networkx.readwrite.graphml.GraphMLWriter.add_edges:
  - 587
  - 588
  - 589
  - 591
  - 592
  - 593
  - 596
  - 598
  - 599
  - 600
  - 602
  - 603
  - 605
  - 607
  - 608
  - 609
  - 613
  - 614
  - 615
  - 616
  networkx.readwrite.graphml.GraphMLWriter.add_graph_element:
  - 640
  - 641
  - 642
  - 648
  - 649
  - 650
  - 619
  - 651
  - 652
  - 622
  - 655
  - 627
  - 628
  - 629
  - 631
  - 637
  networkx.readwrite.graphml.GraphMLWriter.add_graphs:
  - 658
  - 659
  - 660
  networkx.readwrite.graphml.GraphMLWriter.add_nodes:
  - 580
  - 581
  - 582
  - 583
  - 584
  networkx.readwrite.graphml.GraphMLWriter.attr_type:
  - 515
  - 518
  - 519
  - 520
  - 522
  - 527
  - 529
  - 507
  networkx.readwrite.graphml.GraphMLWriter.dump:
  - 665
  - 666
  - 667
  - 668
  networkx.readwrite.graphml.GraphMLWriter.get_key:
  - 548
  - 550
  - 551
  - 552
  - 553
  - 554
  - 536
  - 539
  networkx.readwrite.graphml.GraphMLWriter.indent:
  - 673
  - 674
  - 676
  - 678
  - 679
  - 680
  - 683
  networkx.readwrite.graphml.GraphMLWriterLxml.__init__:
  - 742
  - 744
  - 713
  - 746
  - 747
  - 724
  - 725
  - 726
  - 734
  networkx.readwrite.graphml.GraphMLWriterLxml.__str__:
  - 828
  networkx.readwrite.graphml.GraphMLWriterLxml.add_attributes:
  - 820
  - 821
  - 822
  - 823
  - 825
  networkx.readwrite.graphml.GraphMLWriterLxml.add_graph_element:
  - 771
  - 774
  - 775
  - 777
  - 778
  - 779
  - 780
  - 781
  - 783
  - 784
  - 785
  - 786
  - 787
  - 788
  - 789
  - 791
  - 792
  - 793
  - 794
  - 795
  - 796
  - 797
  - 798
  - 800
  - 801
  - 802
  - 803
  - 804
  - 805
  - 806
  - 809
  - 810
  - 813
  - 815
  - 816
  - 817
  - 750
  - 753
  - 758
  - 759
  - 760
  - 762
  networkx.readwrite.graphml.GraphMLWriterLxml.dump:
  - 832
  - 831
  networkx.readwrite.graphml.IncrementalElement:
  - 688
  networkx.readwrite.graphml.IncrementalElement.append:
  - 699
  networkx.readwrite.graphml.generate_graphml:
  - 232
  - 233
  - 226
  - 196
  networkx.readwrite.graphml.parse_graphml:
  - 378
  - 371
  - 373
  - 374
  - 377
  - 314
  - 379
  networkx.readwrite.graphml.read_graphml:
  - 295
  - 297
  - 298
  - 301
  - 302
  - 239
  - 303
  - 304
  - 305
  networkx.readwrite.graphml.write_graphml_lxml:
  - 167
  - 186
  - 177
  - 127
  networkx.readwrite.graphml.write_graphml_xml:
  - 72
  - 113
  - 106
  - 114
  networkx.readwrite.json_graph:
  - 1
  networkx.readwrite.json_graph.adjacency:
  - 84
  networkx.readwrite.json_graph.adjacency.adjacency_data:
  - 65
  - 67
  - 70
  - 71
  - 9
  - 73
  - 74
  - 75
  - 76
  - 78
  - 79
  - 80
  - 58
  - 62
  networkx.readwrite.json_graph.adjacency.adjacency_graph:
  - 128
  - 130
  - 131
  - 132
  - 136
  - 138
  - 139
  - 140
  - 141
  - 142
  - 143
  - 144
  - 146
  - 147
  - 148
  - 149
  - 150
  - 151
  - 153
  - 154
  - 155
  - 86
  - 125
  - 126
  - 127
  networkx.readwrite.json_graph.cytoscape:
  - 95
  networkx.readwrite.json_graph.cytoscape.cytoscape_data:
  - 65
  - 66
  - 67
  - 7
  - 72
  - 73
  - 74
  - 76
  - 77
  - 79
  - 80
  - 81
  - 85
  - 87
  - 88
  - 91
  - 62
  networkx.readwrite.json_graph.cytoscape.cytoscape_graph:
  - 155
  - 158
  - 159
  - 160
  - 161
  - 163
  - 164
  - 165
  - 166
  - 167
  - 168
  - 171
  - 172
  - 173
  - 174
  - 176
  - 177
  - 179
  - 180
  - 183
  - 184
  - 185
  - 186
  - 188
  - 189
  - 97
  networkx.readwrite.json_graph.node_link:
  - 143
  networkx.readwrite.json_graph.node_link._to_tuple:
  - 10
  - 21
  - 23
  networkx.readwrite.json_graph.node_link.node_link_data:
  - 128
  - 36
  - 133
  - 136
  - 139
  - 121
  - 125
  networkx.readwrite.json_graph.node_link.node_link_graph:
  - 256
  - 257
  - 260
  - 156
  - 230
  - 231
  - 232
  - 233
  - 235
  - 236
  - 237
  - 241
  - 242
  - 243
  - 244
  - 245
  - 246
  - 247
  - 248
  - 249
  - 250
  - 251
  - 252
  - 254
  networkx.readwrite.json_graph.tree:
  - 86
  networkx.readwrite.json_graph.tree.tree_data:
  - 64
  - 67
  - 9
  - 83
  - 60
  - 62
  networkx.readwrite.json_graph.tree.tree_data.add_children:
  - 72
  - 75
  - 77
  - 78
  - 80
  networkx.readwrite.json_graph.tree.tree_graph:
  - 133
  - 134
  - 135
  - 136
  - 118
  - 88
  networkx.readwrite.json_graph.tree.tree_graph.add_children:
  - 128
  - 130
  - 121
  - 123
  - 124
  - 125
  - 126
  networkx.readwrite.leda:
  - 1
  - 21
  - 22
  - 49
  networkx.readwrite.leda.parse_leda:
  - 51
  - 70
  - 71
  - 72
  - 74
  - 76
  - 79
  - 80
  - 82
  - 83
  - 84
  - 86
  - 89
  - 91
  - 92
  - 93
  - 94
  - 97
  - 100
  - 101
  - 103
  - 107
  networkx.readwrite.leda.read_leda:
  - 24
  - 44
  - 45
  networkx.readwrite.multiline_adjlist:
  - 1
  - 194
  - 136
  - 303
  - 304
  networkx.readwrite.multiline_adjlist.generate_multiline_adjlist:
  - 128
  - 129
  - 130
  - 132
  - 133
  - 40
  - 80
  - 81
  - 82
  - 85
  - 86
  - 88
  - 89
  - 90
  - 91
  - 92
  - 94
  - 96
  - 97
  - 98
  - 99
  - 100
  - 101
  - 103
  - 105
  - 106
  - 107
  - 110
  - 112
  - 114
  - 115
  - 116
  - 117
  - 118
  - 120
  - 121
  - 123
  - 124
  - 125
  - 126
  - 127
  networkx.readwrite.multiline_adjlist.parse_multiline_adjlist:
  - 260
  - 261
  - 264
  - 268
  - 269
  - 271
  - 273
  - 274
  - 275
  - 277
  - 278
  - 279
  - 281
  - 286
  - 288
  - 295
  - 298
  - 198
  - 241
  - 242
  - 243
  - 244
  - 246
  - 249
  - 250
  - 253
  - 255
  networkx.readwrite.multiline_adjlist.read_multiline_adjlist:
  - 385
  - 314
  - 386
  networkx.readwrite.multiline_adjlist.write_multiline_adjlist:
  - 138
  - 179
  - 183
  - 187
  - 189
  - 191
  networkx.readwrite.p2g:
  - 1
  - 41
  - 87
  - 62
  - 63
  networkx.readwrite.p2g.parse_p2g:
  - 97
  - 98
  - 103
  - 104
  - 106
  - 107
  - 110
  - 111
  - 112
  - 89
  - 95
  networkx.readwrite.p2g.read_p2g:
  - 65
  - 82
  - 83
  networkx.readwrite.p2g.write_p2g:
  - 43
  - 50
  - 51
  - 52
  - 54
  - 55
  - 56
  - 57
  - 58
  - 59
  networkx.readwrite.pajek:
  - 1
  - 99
  - 132
  - 133
  - 166
  networkx.readwrite.pajek.generate_pajek:
  - 26
  - 38
  - 47
  - 48
  - 50
  - 51
  - 54
  - 55
  - 56
  - 58
  - 68
  - 69
  - 71
  - 72
  - 73
  - 75
  - 76
  - 78
  - 81
  - 82
  - 84
  - 85
  - 86
  - 87
  - 88
  - 89
  - 90
  - 91
  - 93
  - 94
  - 96
  networkx.readwrite.pajek.make_qstr:
  - 282
  - 283
  - 284
  - 279
  networkx.readwrite.pajek.parse_pajek:
  - 260
  - 261
  - 264
  - 265
  - 266
  - 269
  - 270
  - 271
  - 273
  - 168
  - 187
  - 188
  - 189
  - 190
  - 194
  - 197
  - 199
  - 205
  - 207
  - 208
  - 209
  - 212
  - 215
  - 217
  - 218
  - 223
  - 224
  - 228
  - 229
  - 230
  - 231
  - 233
  - 234
  - 236
  - 237
  - 240
  - 243
  - 245
  - 248
  - 249
  - 255
  networkx.readwrite.pajek.read_pajek:
  - 162
  - 163
  - 135
  networkx.readwrite.pajek.write_pajek:
  - 129
  - 101
  - 127
  networkx.readwrite.sparse6:
  - 3
  - 105
  - 254
  - 253
  - 318
  - 319
  networkx.readwrite.sparse6._generate_sparse6_bytes:
  - 24
  - 44
  - 45
  - 49
  - 50
  - 51
  - 52
  - 53
  - 63
  - 66
  - 67
  - 68
  - 69
  - 70
  - 72
  - 73
  - 76
  - 77
  - 78
  - 79
  - 80
  - 85
  - 86
  - 88
  - 97
  - 100
  - 101
  - 102
  networkx.readwrite.sparse6._generate_sparse6_bytes.enc:
  - 60
  - 61
  networkx.readwrite.sparse6.from_sparse6_bytes:
  - 192
  - 195
  - 197
  - 198
  - 199
  - 107
  - 139
  - 141
  - 145
  - 182
  - 183
  - 186
  - 187
  - 190
  networkx.readwrite.sparse6.from_sparse6_bytes.parseData:
  - 170
  - 178
  - 151
  - 152
  - 157
  - 159
  networkx.readwrite.sparse6.read_sparse6:
  - 256
  - 307
  - 308
  - 309
  - 311
  - 312
  networkx.readwrite.sparse6.to_sparse6_bytes:
  - 204
  - 247
  - 248
  - 249
  - 250
  networkx.readwrite.sparse6.write_sparse6:
  - 321
  - 375
  - 376
  - 377
  - 378
  - 379
  networkx.readwrite.text:
  - 1
  - 422
  networkx.readwrite.text.BaseGlyphs.as_dict:
  - 18
  - 19
  - 20
  networkx.readwrite.text._find_sources:
  - 640
  - 641
  - 611
  - 643
  - 616
  - 618
  - 622
  - 623
  - 627
  - 629
  - 631
  - 632
  - 634
  - 635
  networkx.readwrite.text._parse_network_text:
  - 769
  - 771
  - 772
  - 648
  - 778
  - 780
  - 781
  - 783
  - 784
  - 785
  - 787
  - 790
  - 791
  - 793
  - 795
  - 799
  - 674
  - 804
  - 810
  - 811
  - 813
  - 688
  - 817
  - 690
  - 692
  - 695
  - 825
  - 827
  - 701
  - 830
  - 834
  - 835
  - 710
  - 711
  - 712
  - 838
  - 714
  - 715
  - 839
  - 840
  - 842
  - 844
  - 848
  - 721
  - 722
  - 849
  - 724
  - 850
  - 727
  - 728
  - 730
  - 733
  - 734
  - 736
  - 737
  - 738
  - 741
  - 745
  - 756
  - 766
  networkx.readwrite.text.generate_network_text:
  - 259
  - 387
  - 261
  - 262
  - 388
  - 390
  - 265
  - 266
  - 268
  - 396
  - 270
  - 397
  - 272
  - 399
  - 401
  - 402
  - 276
  - 403
  - 405
  - 280
  - 283
  - 286
  - 414
  - 416
  - 290
  - 419
  - 293
  - 296
  - 298
  - 300
  - 303
  - 313
  - 317
  - 324
  - 329
  - 330
  - 332
  - 335
  - 336
  - 81
  - 343
  - 347
  - 225
  - 227
  - 363
  - 236
  - 365
  - 238
  - 378
  - 369
  - 243
  - 244
  - 245
  - 246
  - 371
  - 379
  - 250
  - 251
  - 380
  - 382
  networkx.readwrite.text.write_network_text:
  - 587
  - 590
  - 593
  - 433
  - 599
  - 607
  networkx.relabel:
  - 226
  - 6
  networkx.relabel._relabel_copy:
  - 194
  - 195
  - 196
  - 197
  - 199
  - 200
  - 204
  - 205
  - 206
  - 208
  - 211
  - 212
  - 213
  - 216
  - 218
  - 219
  - 220
  - 222
  networkx.relabel._relabel_inplace:
  - 131
  - 134
  - 135
  - 137
  - 147
  - 148
  - 150
  - 154
  - 157
  - 159
  - 162
  - 164
  - 167
  - 170
  - 171
  - 172
  - 173
  - 177
  - 181
  - 183
  - 186
  - 188
  - 189
  networkx.relabel.convert_node_labels_to_integers:
  - 264
  - 265
  - 266
  - 267
  - 268
  - 269
  - 270
  - 271
  - 272
  - 273
  - 274
  - 275
  - 276
  - 277
  - 278
  - 281
  - 283
  - 284
  - 230
  networkx.relabel.relabel_nodes:
  - 10
  - 122
  - 124
  - 125
  - 127
  networkx.utils.backends:
  - 102
  - 2152
  - 41
  - 2168
  - 2169
  - 2170
  networkx.utils.backends._LazyArgsRepr:
  - 2136
  networkx.utils.backends._LazyArgsRepr.__repr__:
  - 2145
  - 2146
  - 2147
  networkx.utils.backends._comma_sep_to_list:
  - 115
  networkx.utils.backends._dispatchable:
  - 2161
  - 2162
  - 2163
  networkx.utils.backends._dispatchable.__doc__:
  - 497
  - 491
  - 492
  - 486
  networkx.utils.backends._dispatchable.__new__:
  - 393
  - 397
  - 401
  - 406
  - 411
  - 416
  - 421
  - 427
  - 429
  - 431
  - 435
  - 439
  - 440
  - 441
  - 445
  - 447
  - 450
  - 463
  - 466
  - 467
  - 340
  - 341
  - 469
  - 480
  - 355
  - 358
  - 361
  - 234
  - 369
  - 375
  networkx.utils.backends._dispatchable.__reduce__:
  - 1966
  networkx.utils.backends._dispatchable.__signature__:
  - 512
  - 513
  - 515
  - 527
  - 528
  - 505
  - 508
  - 509
  networkx.utils.backends._dispatchable._call_if_any_backends_installed:
  - 1032
  - 555
  - 561
  - 565
  - 566
  - 567
  - 570
  - 572
  - 578
  - 579
  - 594
  - 596
  - 597
  - 598
  - 600
  - 606
  - 607
  - 610
  - 611
  - 612
  - 617
  - 618
  - 621
  - 624
  - 630
  - 633
  - 640
  - 641
  - 653
  - 655
  - 656
  - 659
  - 667
  - 668
  - 669
  - 670
  - 682
  - 690
  - 691
  - 695
  - 697
  - 705
  - 707
  - 717
  - 742
  - 750
  - 751
  - 758
  - 759
  - 769
  - 772
  - 773
  - 776
  - 783
  - 788
  - 791
  - 792
  - 795
  - 810
  - 813
  - 879
  - 882
  - 883
  - 885
  - 886
  - 887
  - 889
  - 892
  - 893
  - 895
  - 896
  - 897
  - 899
  - 902
  - 919
  - 929
  - 930
  - 933
  - 941
  - 942
  - 943
  - 945
  - 946
  - 947
  - 948
  - 950
  - 951
  - 952
  - 955
  - 967
  - 978
  - 980
  - 989
  - 990
  - 994
  - 997
  - 1002
  - 1013
  - 1023
  networkx.utils.backends._dispatchable._call_if_no_backends_installed:
  - 545
  - 551
  - 542
  - 543
  networkx.utils.backends._dispatchable._call_with_backend:
  - 1485
  - 1486
  - 1487
  - 1488
  - 1489
  - 1493
  - 1496
  - 1498
  - 1499
  networkx.utils.backends._dispatchable._can_backend_run:
  - 1100
  - 1101
  - 1103
  - 1106
  - 1107
  - 1111
  - 1112
  - 1113
  - 1114
  - 1118
  networkx.utils.backends._dispatchable._can_convert:
  - 1080
  - 1083
  - 1084
  networkx.utils.backends._dispatchable._convert_and_call:
  - 1568
  - 1537
  - 1569
  - 1540
  - 1541
  - 1542
  - 1573
  - 1576
  - 1578
  - 1547
  - 1579
  - 1518
  - 1557
  - 1531
  - 1565
  - 1534
  - 1535
  networkx.utils.backends._dispatchable._convert_and_call_for_tests:
  - 1591
  - 1592
  - 1593
  - 1594
  - 1595
  - 1596
  - 1601
  - 1603
  - 1608
  - 1610
  - 1650
  - 1654
  - 1657
  - 1659
  - 1660
  - 1661
  - 1662
  - 1663
  - 1664
  - 1665
  - 1670
  - 1673
  - 1675
  - 1676
  - 1677
  - 1678
  - 1679
  - 1680
  - 1681
  - 1683
  - 1686
  - 1687
  - 1690
  - 1698
  - 1699
  - 1705
  - 1708
  - 1709
  - 1712
  - 1714
  - 1715
  - 1716
  - 1717
  - 1718
  - 1720
  - 1721
  - 1724
  - 1726
  - 1730
  - 1733
  - 1735
  - 1736
  - 1743
  - 1746
  - 1747
  - 1753
  - 1756
  - 1757
  - 1758
  - 1759
  - 1760
  - 1767
  - 1772
  - 1815
  - 1818
  - 1819
  - 1822
  - 1827
  - 1829
  - 1846
  - 1848
  - 1849
  - 1852
  - 1853
  - 1854
  - 1856
  - 1857
  - 1861
  - 1864
  - 1865
  networkx.utils.backends._dispatchable._convert_and_call_for_tests.assert_graphs_equal:
  - 1834
  - 1835
  - 1836
  - 1837
  - 1838
  - 1843
  - 1844
  networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_iterator:
  - 1808
  - 1813
  - 1806
  networkx.utils.backends._dispatchable._convert_and_call_for_tests.check_result:
  - 1792
  - 1793
  - 1794
  - 1796
  - 1798
  - 1799
  - 1800
  - 1801
  - 1802
  - 1803
  - 1786
  - 1790
  networkx.utils.backends._dispatchable._convert_arguments:
  - 1282
  - 1155
  - 1156
  - 1157
  - 1161
  - 1292
  - 1293
  - 1299
  - 1172
  - 1300
  - 1302
  - 1175
  - 1178
  - 1179
  - 1186
  - 1187
  - 1314
  - 1189
  - 1320
  - 1321
  - 1326
  - 1328
  - 1202
  - 1332
  - 1205
  - 1206
  - 1334
  - 1338
  - 1212
  - 1342
  - 1343
  - 1216
  - 1219
  - 1233
  - 1234
  - 1238
  - 1241
  - 1244
  - 1245
  - 1252
  - 1253
  - 1255
  - 1268
  - 1271
  - 1272
  - 1149
  - 1278
  networkx.utils.backends._dispatchable._convert_graph:
  - 1409
  - 1419
  - 1422
  - 1429
  - 1432
  - 1433
  - 1444
  - 1446
  - 1448
  - 1449
  - 1452
  - 1454
  - 1468
  - 1469
  - 1471
  - 1472
  - 1473
  - 1476
  - 1373
  - 1374
  - 1375
  - 1376
  - 1383
  - 1384
  - 1385
  - 1386
  networkx.utils.backends._dispatchable._does_backend_have:
  - 1096
  - 1097
  - 1092
  - 1093
  networkx.utils.backends._dispatchable._make_doc:
  - 1920
  - 1921
  - 1922
  - 1926
  - 1928
  - 1929
  - 1930
  - 1931
  - 1934
  - 1935
  - 1937
  - 1939
  - 1941
  - 1942
  - 1944
  - 1946
  - 1951
  - 1961
  - 1962
  - 1871
  - 1874
  - 1881
  - 1883
  - 1884
  - 1886
  - 1887
  - 1888
  - 1894
  - 1895
  - 1897
  - 1898
  - 1905
  - 1906
  - 1907
  - 1909
  - 1910
  - 1911
  - 1912
  - 1913
  - 1914
  - 1915
  - 1916
  - 1918
  networkx.utils.backends._dispatchable._should_backend_run:
  - 1125
  - 1132
  - 1134
  - 1135
  - 1136
  - 1137
  - 1138
  - 1142
  networkx.utils.backends._dispatchable._will_call_mutate_input:
  - 1068
  - 1069
  - 1070
  - 1071
  - 1073
  - 1074
  - 1055
  networkx.utils.backends._do_nothing:
  - 189
  networkx.utils.backends._get_backends:
  - 69
  - 71
  - 72
  - 73
  - 46
  - 78
  - 79
  - 84
  - 86
  - 88
  - 95
  networkx.utils.backends._get_cache_key:
  - 1985
  - 1994
  - 1991
  networkx.utils.backends._get_from_cache:
  - 2052
  - 2053
  - 2057
  - 2059
  - 2061
  - 2063
  - 2067
  - 2069
  - 2071
  - 2073
  - 2075
  - 2078
  - 2001
  - 2024
  - 2025
  - 2026
  - 2034
  - 2038
  - 2041
  - 2044
  networkx.utils.backends._load_backend:
  - 203
  - 205
  - 207
  - 208
  - 210
  networkx.utils.backends._set_configs_from_environment:
  - 128
  - 129
  - 134
  - 135
  - 136
  - 139
  - 140
  - 142
  - 145
  - 147
  - 149
  - 152
  - 153
  - 155
  - 156
  - 157
  - 166
  - 167
  - 168
  - 172
  - 174
  - 175
  - 177
  - 181
  - 182
  - 183
  - 119
  - 127
  networkx.utils.backends._set_to_cache:
  - 2115
  - 2117
  - 2085
  - 2118
  - 2121
  - 2123
  - 2125
  - 2127
  - 2130
  - 2106
  - 2107
  networkx.utils.configs:
  - 225
  networkx.utils.configs.BackendPriorities:
  - 229
  networkx.utils.configs.BackendPriorities._on_delattr:
  - 273
  networkx.utils.configs.BackendPriorities._on_setattr:
  - 257
  - 263
  - 267
  - 268
  - 255
  networkx.utils.configs.Config:
  - 10
  networkx.utils.configs.Config.__call__:
  - 192
  - 193
  - 190
  - 191
  networkx.utils.configs.Config.__delattr__:
  - 121
  - 122
  - 117
  networkx.utils.configs.Config.__delitem__:
  - 155
  networkx.utils.configs.Config.__dir__:
  - 107
  networkx.utils.configs.Config.__enter__:
  - 206
  - 198
  networkx.utils.configs.Config.__eq__:
  - 176
  - 178
  networkx.utils.configs.Config.__exit__:
  - 211
  - 212
  - 213
  networkx.utils.configs.Config.__getitem__:
  - 143
  networkx.utils.configs.Config.__iter__:
  - 132
  networkx.utils.configs.Config.__len__:
  - 135
  networkx.utils.configs.Config.__new__:
  - 75
  - 77
  - 82
  - 89
  - 94
  - 95
  networkx.utils.configs.Config.__reduce__:
  - 182
  networkx.utils.configs.Config.__reversed__:
  - 138
  networkx.utils.configs.Config.__setattr__:
  - 112
  - 113
  - 110
  networkx.utils.configs.Config.__setitem__:
  - 149
  networkx.utils.configs.Config._deserialize:
  - 186
  networkx.utils.configs.Config._on_delattr:
  - 103
  networkx.utils.configs.Config._on_setattr:
  - 99
  networkx.utils.configs.Config.get:
  - 163
  networkx.utils.configs.Config.items:
  - 166
  networkx.utils.configs.Config.keys:
  - 169
  networkx.utils.configs.Config.values:
  - 172
  networkx.utils.configs.NetworkXConfig:
  - 278
  networkx.utils.configs.NetworkXConfig._on_setattr:
  - 384
  - 385
  - 390
  - 391
  - 351
  - 352
  - 354
  - 355
  - 357
  - 360
  - 362
  - 363
  - 364
  - 365
  - 369
  - 370
  - 371
  - 372
  - 373
  - 378
  - 379
  - 381
  - 382
  networkx.utils.configs._flexible_repr:
  - 219
  networkx.utils.decorators:
  - 101
  networkx.utils.decorators.argmap:
  - 372
  - 1151
  - 847
  networkx.utils.decorators.argmap.__call__:
  - 814
  - 817
  - 819
  - 790
  - 793
  - 763
  networkx.utils.decorators.argmap.__call__.func:
  - 784
  networkx.utils.decorators.argmap._count:
  - 828
  networkx.utils.decorators.argmap._flatten:
  - 1184
  - 1185
  - 1188
  - 1189
  - 1191
  - 1167
  - 1183
  networkx.utils.decorators.argmap._indent:
  - 1232
  - 1197
  - 1231
  networkx.utils.decorators.argmap._lazy_compile:
  - 756
  - 717
  - 758
  - 759
  networkx.utils.decorators.argmap._name:
  - 867
  - 865
  - 866
  - 851
  networkx.utils.decorators.argmap.assemble:
  - 1032
  - 918
  - 1047
  - 1046
  - 1048
  - 1050
  - 1049
  - 1053
  - 1054
  - 973
  - 981
  - 982
  - 984
  - 985
  - 987
  - 990
  - 991
  - 993
  - 1006
  networkx.utils.decorators.argmap.assemble.get_name:
  - 1025
  - 1010
  - 1011
  - 1013
  - 1015
  - 1016
  - 1018
  - 1019
  networkx.utils.decorators.argmap.compile:
  - 899
  - 870
  - 903
  - 905
  - 906
  - 909
  - 910
  - 911
  - 912
  networkx.utils.decorators.argmap.signature:
  - 1122
  - 1093
  - 1061
  - 1126
  - 1102
  - 1136
  - 1137
  - 1108
  - 1140
  - 1110
  - 1111
  - 1142
  - 1145
  - 1147
  - 1144
  - 1149
  - 1119
  networkx.utils.decorators.nodes_or_number:
  - 201
  - 261
  - 257
  networkx.utils.decorators.nodes_or_number._nodes_or_number:
  - 248
  - 250
  - 252
  networkx.utils.decorators.not_implemented_for:
  - 68
  - 70
  - 72
  - 81
  - 25
  - 91
  networkx.utils.decorators.not_implemented_for._not_implemented_for:
  - 84
  - 85
  networkx.utils.decorators.np_random_state:
  - 265
  - 308
  networkx.utils.decorators.open_file:
  - 105
  - 197
  networkx.utils.decorators.open_file._open_file:
  - 192
  - 194
  - 195
  - 184
  - 185
  - 186
  - 189
  networkx.utils.decorators.open_file._open_file.<lambda2>:
  - 195
  networkx.utils.decorators.py_random_state:
  - 312
  - 368
  networkx.utils.heaps:
  - 1
  networkx.utils.heaps.BinaryHeap:
  - 282
  networkx.utils.heaps.BinaryHeap.__init__:
  - 288
  - 285
  - 286
  networkx.utils.heaps.BinaryHeap.get:
  - 320
  networkx.utils.heaps.BinaryHeap.insert:
  - 337
  - 324
  - 326
  - 332
  networkx.utils.heaps.BinaryHeap.min:
  - 299
  - 292
  - 301
  networkx.utils.heaps.BinaryHeap.pop:
  - 313
  - 306
  - 314
  networkx.utils.heaps.MinHeap:
  - 14
  networkx.utils.heaps.MinHeap._Item:
  - 22
  networkx.utils.heaps.MinHeap._Item.__repr__:
  - 31
  networkx.utils.heaps.MinHeap.__bool__:
  - 114
  - 115
  networkx.utils.heaps.MinHeap.__contains__:
  - 122
  networkx.utils.heaps.MinHeap.__init__:
  - 34
  networkx.utils.heaps.MinHeap.__len__:
  - 118
  - 119
  networkx.utils.heaps.MinHeap.__nonzero__:
  - 110
  - 111
  networkx.utils.heaps.MinHeap.get:
  - 68
  networkx.utils.heaps.MinHeap.insert:
  - 87
  networkx.utils.heaps.MinHeap.min:
  - 38
  networkx.utils.heaps.MinHeap.pop:
  - 53
  networkx.utils.heaps.PairingHeap:
  - 133
  networkx.utils.heaps.PairingHeap._Node:
  - 136
  networkx.utils.heaps.PairingHeap._Node.__init__:
  - 145
  networkx.utils.heaps.PairingHeap.__init__:
  - 156
  - 157
  networkx.utils.heaps.PairingHeap._cut:
  - 275
  - 267
  - 270
  networkx.utils.heaps.PairingHeap._link:
  - 217
  - 221
  - 214
  networkx.utils.heaps.PairingHeap._merge_children:
  - 258
  - 229
  - 234
  - 243
  - 247
  - 250
  networkx.utils.heaps.PairingHeap.get:
  - 174
  networkx.utils.heaps.PairingHeap.insert:
  - 192
  - 193
  - 208
  - 178
  - 210
  - 180
  - 181
  - 183
  - 184
  - 185
  - 187
  - 189
  networkx.utils.heaps.PairingHeap.min:
  - 161
  networkx.utils.heaps.PairingHeap.pop:
  - 169
  - 166
  networkx.utils.mapped_queue:
  - 1
  networkx.utils.mapped_queue.MappedQueue:
  - 92
  networkx.utils.mapped_queue.MappedQueue.__init__:
  - 160
  - 162
  - 154
  - 155
  - 157
  - 158
  networkx.utils.mapped_queue.MappedQueue.__len__:
  - 172
  networkx.utils.mapped_queue.MappedQueue._heapify:
  - 168
  - 165
  - 166
  - 167
  networkx.utils.mapped_queue.MappedQueue._siftdown:
  - 291
  - 279
  networkx.utils.mapped_queue.MappedQueue._siftup:
  - 257
  - 270
  - 240
  - 246
  - 255
  networkx.utils.mapped_queue.MappedQueue.pop:
  - 195
  - 196
  - 199
  - 203
  - 190
  networkx.utils.mapped_queue.MappedQueue.push:
  - 175
  - 176
  - 177
  - 179
  - 182
  - 183
  - 186
  networkx.utils.mapped_queue.MappedQueue.remove:
  - 229
  - 230
  - 233
  - 237
  - 220
  networkx.utils.mapped_queue.MappedQueue.update:
  - 208
  - 209
  - 210
  - 217
  networkx.utils.mapped_queue._HeapElement:
  - 9
  networkx.utils.mapped_queue._HeapElement.__gt__:
  - 59
  networkx.utils.mapped_queue._HeapElement.__init__:
  - 36
  networkx.utils.mapped_queue._HeapElement.__iter__:
  - 81
  - 83
  - 85
  networkx.utils.mapped_queue._HeapElement.__lt__:
  - 44
  networkx.utils.misc:
  - 1
  networkx.utils.misc.PythonRandomInterface:
  - 360
  networkx.utils.misc.PythonRandomInterface.__init__:
  - 369
  - 371
  networkx.utils.misc.PythonRandomInterface.choice:
  - 400
  - 401
  - 403
  networkx.utils.misc.PythonRandomInterface.expovariate:
  - 431
  networkx.utils.misc.PythonRandomInterface.gauss:
  - 407
  networkx.utils.misc.PythonRandomInterface.paretovariate:
  - 435
  networkx.utils.misc.PythonRandomInterface.randint:
  - 421
  - 422
  - 423
  - 425
  - 426
  - 427
  networkx.utils.misc.PythonRandomInterface.random:
  - 377
  networkx.utils.misc.PythonRandomInterface.randrange:
  - 385
  - 387
  - 388
  - 389
  - 391
  - 392
  - 393
  networkx.utils.misc.PythonRandomInterface.sample:
  - 416
  networkx.utils.misc.PythonRandomInterface.shuffle:
  - 410
  networkx.utils.misc.PythonRandomInterface.uniform:
  - 380
  networkx.utils.misc.PythonRandomViaNumpyBits:
  - 302
  networkx.utils.misc.PythonRandomViaNumpyBits.__init__:
  - 324
  - 326
  networkx.utils.misc.PythonRandomViaNumpyBits.getrandbits:
  - 344
  - 340
  - 341
  networkx.utils.misc.PythonRandomViaNumpyBits.getstate:
  - 348
  networkx.utils.misc.PythonRandomViaNumpyBits.random:
  - 336
  - 337
  networkx.utils.misc.PythonRandomViaNumpyBits.seed:
  - 354
  networkx.utils.misc.PythonRandomViaNumpyBits.setstate:
  - 351
  networkx.utils.misc._clear_cache:
  - 650
  - 651
  - 646
  networkx.utils.misc._dict_to_numpy_array1:
  - 131
  - 134
  - 135
  - 136
  - 137
  - 138
  - 139
  networkx.utils.misc._dict_to_numpy_array2:
  - 108
  - 114
  - 115
  - 116
  - 117
  - 118
  - 119
  - 120
  - 121
  - 122
  networkx.utils.misc.arbitrary_element:
  - 208
  - 146
  - 211
  networkx.utils.misc.check_create_using:
  - 685
  - 655
  - 689
  - 690
  - 692
  - 693
  - 695
  - 698
  - 699
  - 701
  networkx.utils.misc.create_py_random_state:
  - 450
  - 486
  - 488
  - 490
  - 491
  - 498
  - 500
  - 501
  - 502
  - 503
  - 505
  - 506
  - 507
  - 509
  networkx.utils.misc.create_random_state:
  - 288
  - 290
  - 291
  - 292
  - 272
  - 286
  networkx.utils.misc.dict_to_numpy_array:
  - 104
  - 97
  - 100
  networkx.utils.misc.edges_equal:
  - 608
  - 610
  - 611
  - 613
  - 615
  - 616
  - 617
  - 543
  - 620
  - 607
  networkx.utils.misc.flatten:
  - 47
  - 48
  - 50
  - 52
  - 53
  - 54
  - 56
  - 57
  networkx.utils.misc.graphs_equal:
  - 624
  networkx.utils.misc.groups:
  - 265
  - 266
  - 267
  - 268
  - 250
  networkx.utils.misc.make_list_of_ints:
  - 69
  - 71
  - 74
  - 77
  - 79
  - 82
  - 84
  - 87
  - 90
  - 61
  networkx.utils.misc.nodes_equal:
  - 516
  - 531
  - 532
  - 534
  - 535
  - 537
  - 538
  networkx.utils.misc.pairwise:
  - 242
  - 243
  - 244
  - 245
  - 246
  - 215
  networkx.utils.random_sequence:
  - 65
  - 1
  - 141
  - 173
  - 25
  - 187
  networkx.utils.random_sequence.cumulative_distribution:
  - 137
  - 131
  - 135
  networkx.utils.random_sequence.discrete_sequence:
  - 166
  - 169
  - 143
  - 156
  - 158
  - 159
  networkx.utils.random_sequence.is_valid_tree_degree_sequence:
  - 34
  - 54
  - 55
  - 56
  - 58
  - 60
  networkx.utils.random_sequence.powerlaw_sequence:
  - 27
  - 30
  networkx.utils.random_sequence.random_weighted_sample:
  - 175
  - 179
  - 181
  - 182
  - 183
  - 184
  networkx.utils.random_sequence.weighted_choice:
  - 197
  - 194
  - 195
  - 189
  networkx.utils.random_sequence.zipf_rv:
  - 67
  - 114
  - 116
  - 121
  - 122
  - 123
  - 125
  networkx.utils.rcm:
  - 1
  networkx.utils.rcm.connected_cuthill_mckee_ordering:
  - 130
  - 131
  - 133
  - 135
  - 137
  - 138
  - 139
  - 141
  - 142
  networkx.utils.rcm.cuthill_mckee_ordering:
  - 16
  - 68
  - 69
  networkx.utils.rcm.pseudo_peripheral_node:
  - 148
  - 152
  - 153
  - 154
  - 157
  - 158
  networkx.utils.rcm.reverse_cuthill_mckee_ordering:
  - 73
  - 125
  networkx.utils.union_find:
  - 1
  networkx.utils.union_find.UnionFind:
  - 9
  networkx.utils.union_find.UnionFind.__getitem__:
  - 64
  - 50
  - 59
  - 47
  networkx.utils.union_find.UnionFind.__init__:
  - 32
  - 42
  - 38
  networkx.utils.union_find.UnionFind.__iter__:
  - 69
  - 70
  networkx.utils.union_find.UnionFind.to_sets:
  - 89
  - 73
  - 86
  networkx.utils.union_find.UnionFind.union:
  - 96
  - 100
  - 104
  - 92
  - 94
  - 95
Fuzzer filename: /src/fuzz_graphml.py
Inheritance:
  networkx.algorithms.approximation.kcomponents._AntiGraph: []
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAdjacencyView:
  - AntiAtlasView
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiAtlasView:
  - Mapping
  networkx.algorithms.approximation.kcomponents._AntiGraph.AntiDegreeView: []
  networkx.algorithms.approximation.treewidth.MinDegreeHeuristic: []
  networkx.algorithms.centrality.flow_matrix.CGInverseLaplacian:
  - InverseLaplacian
  networkx.algorithms.centrality.flow_matrix.FullInverseLaplacian:
  - InverseLaplacian
  networkx.algorithms.centrality.flow_matrix.InverseLaplacian: []
  networkx.algorithms.centrality.flow_matrix.SuperLUInverseLaplacian:
  - InverseLaplacian
  networkx.algorithms.chordal.NetworkXTreewidthBoundExceeded: []
  networkx.algorithms.clique.MaxWeightClique: []
  networkx.algorithms.cluster.square_clustering.GAdj:
  - dict
  networkx.algorithms.coloring.greedy_coloring._AdjEntry: []
  networkx.algorithms.coloring.greedy_coloring._Node: []
  networkx.algorithms.community.quality.NotAPartition:
  - NetworkXError
  networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph: []
  networkx.algorithms.cycles._NeighborhoodCache:
  - dict
  networkx.algorithms.flow.networksimplex._DataEssentialsAndFunctions: []
  networkx.algorithms.flow.utils.CurrentEdge: []
  networkx.algorithms.flow.utils.GlobalRelabelThreshold: []
  networkx.algorithms.flow.utils.Level: []
  networkx.algorithms.isomorphism.ismags.EdgeLookup: []
  networkx.algorithms.isomorphism.ismags.ISMAGS: []
  networkx.algorithms.isomorphism.isomorphvf2.DiGMState: []
  networkx.algorithms.isomorphism.isomorphvf2.DiGraphMatcher:
  - GraphMatcher
  networkx.algorithms.isomorphism.isomorphvf2.GMState: []
  networkx.algorithms.isomorphism.isomorphvf2.GraphMatcher: []
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingDiGraphMatcher:
  - DiGraphMatcher
  networkx.algorithms.isomorphism.temporalisomorphvf2.TimeRespectingGraphMatcher:
  - GraphMatcher
  networkx.algorithms.isomorphism.vf2userfunc.DiGraphMatcher: []
  networkx.algorithms.isomorphism.vf2userfunc.GraphMatcher: []
  networkx.algorithms.isomorphism.vf2userfunc.MultiDiGraphMatcher:
  - DiGraphMatcher
  networkx.algorithms.isomorphism.vf2userfunc.MultiGraphMatcher:
  - GraphMatcher
  networkx.algorithms.matching.max_weight_matching.Blossom: []
  networkx.algorithms.matching.max_weight_matching.NoNode: []
  networkx.algorithms.planarity.ConflictPair: []
  networkx.algorithms.planarity.Interval: []
  networkx.algorithms.planarity.LRPlanarity: []
  networkx.algorithms.planarity.PlanarEmbedding: []
  networkx.algorithms.similarity.optimize_edit_paths.CostMatrix: []
  networkx.algorithms.simple_paths.PathBuffer: []
  networkx.algorithms.tree.branchings.ArborescenceIterator: []
  networkx.algorithms.tree.branchings.ArborescenceIterator.Partition: []
  networkx.algorithms.tree.coding.NotATree: []
  networkx.algorithms.tree.mst.EdgePartition:
  - Enum
  networkx.algorithms.tree.mst.SpanningTreeIterator: []
  networkx.algorithms.tree.mst.SpanningTreeIterator.Partition: []
  networkx.classes.coreviews.AdjacencyView:
  - AtlasView
  networkx.classes.coreviews.AtlasView:
  - Mapping
  networkx.classes.coreviews.FilterAdjacency:
  - Mapping
  networkx.classes.coreviews.FilterAtlas:
  - Mapping
  networkx.classes.coreviews.FilterMultiAdjacency:
  - FilterAdjacency
  networkx.classes.coreviews.FilterMultiInner:
  - FilterAdjacency
  networkx.classes.coreviews.MultiAdjacencyView:
  - AdjacencyView
  networkx.classes.coreviews.UnionAdjacency:
  - Mapping
  networkx.classes.coreviews.UnionAtlas:
  - Mapping
  networkx.classes.coreviews.UnionMultiAdjacency:
  - UnionAdjacency
  networkx.classes.coreviews.UnionMultiInner:
  - UnionAtlas
  networkx.classes.digraph.DiGraph:
  - Graph
  networkx.classes.digraph._CachedPropertyResetterAdjAndSucc: []
  networkx.classes.digraph._CachedPropertyResetterPred: []
  networkx.classes.filters.show_nodes: []
  networkx.classes.graph.Graph: []
  networkx.classes.graph._CachedPropertyResetterAdj: []
  networkx.classes.graph._CachedPropertyResetterNode: []
  networkx.classes.multidigraph.MultiDiGraph:
  - MultiGraph
  - DiGraph
  networkx.classes.multigraph.MultiGraph:
  - Graph
  networkx.classes.reportviews.DegreeView:
  - DiDegreeView
  networkx.classes.reportviews.DiDegreeView: []
  networkx.classes.reportviews.DiMultiDegreeView:
  - DiDegreeView
  networkx.classes.reportviews.EdgeDataView:
  - OutEdgeDataView
  networkx.classes.reportviews.EdgeView:
  - OutEdgeView
  networkx.classes.reportviews.EdgeViewABC:
  - ABC
  networkx.classes.reportviews.InDegreeView:
  - DiDegreeView
  networkx.classes.reportviews.InEdgeDataView:
  - OutEdgeDataView
  networkx.classes.reportviews.InEdgeView:
  - OutEdgeView
  networkx.classes.reportviews.InMultiDegreeView:
  - DiDegreeView
  networkx.classes.reportviews.InMultiEdgeDataView:
  - OutMultiEdgeDataView
  networkx.classes.reportviews.InMultiEdgeView:
  - OutMultiEdgeView
  networkx.classes.reportviews.MultiDegreeView:
  - DiDegreeView
  networkx.classes.reportviews.MultiEdgeDataView:
  - OutMultiEdgeDataView
  networkx.classes.reportviews.MultiEdgeView:
  - OutMultiEdgeView
  networkx.classes.reportviews.NodeDataView:
  - Set
  networkx.classes.reportviews.NodeView:
  - Set
  - Mapping
  networkx.classes.reportviews.OutDegreeView:
  - DiDegreeView
  networkx.classes.reportviews.OutEdgeDataView:
  - EdgeViewABC
  networkx.classes.reportviews.OutEdgeView:
  - Set
  - Mapping
  - EdgeViewABC
  networkx.classes.reportviews.OutMultiDegreeView:
  - DiDegreeView
  networkx.classes.reportviews.OutMultiEdgeDataView:
  - OutEdgeDataView
  networkx.classes.reportviews.OutMultiEdgeView:
  - OutEdgeView
  networkx.drawing.nx_pylab.CurvedArrowTextBase: []
  networkx.drawing.nx_pylab.FancyArrowFactory: []
  networkx.drawing.nx_pylab.FancyArrowFactory.ConnectionStyleFactory: []
  networkx.drawing.nx_pylab.display.CurvedArrowText:
  - CurvedArrowTextBase
  networkx.drawing.nx_pylab.draw_networkx_edge_labels.CurvedArrowText:
  - CurvedArrowTextBase
  networkx.exception.AmbiguousSolution:
  - NetworkXException
  networkx.exception.ExceededMaxIterations:
  - NetworkXException
  networkx.exception.HasACycle:
  - NetworkXException
  networkx.exception.NetworkXAlgorithmError:
  - NetworkXException
  networkx.exception.NetworkXError:
  - NetworkXException
  networkx.exception.NetworkXException:
  - Exception
  networkx.exception.NetworkXNoCycle:
  - NetworkXUnfeasible
  networkx.exception.NetworkXNoPath:
  - NetworkXUnfeasible
  networkx.exception.NetworkXNotImplemented:
  - NetworkXException
  networkx.exception.NetworkXPointlessConcept:
  - NetworkXException
  networkx.exception.NetworkXUnbounded:
  - NetworkXAlgorithmError
  networkx.exception.NetworkXUnfeasible:
  - NetworkXAlgorithmError
  networkx.exception.NodeNotFound:
  - NetworkXException
  networkx.exception.PowerIterationFailedConvergence:
  - ExceededMaxIterations
  networkx.generators.degree_seq.DegreeSequenceRandomGraph: []
  networkx.generators.internet_as_graphs.AS_graph_generator: []
  networkx.lazy_imports.DelayedImportErrorModule: []
  networkx.linalg.algebraicconnectivity._LUSolver: []
  networkx.linalg.algebraicconnectivity._PCGSolver: []
  networkx.readwrite.gexf.GEXF: []
  networkx.readwrite.gexf.GEXFReader:
  - GEXF
  networkx.readwrite.gexf.GEXFWriter:
  - GEXF
  networkx.readwrite.gml.Pattern:
  - Enum
  networkx.readwrite.gml.Token:
  - NamedTuple
  networkx.readwrite.graphml.GraphML: []
  networkx.readwrite.graphml.GraphMLReader:
  - GraphML
  networkx.readwrite.graphml.GraphMLWriter:
  - GraphML
  networkx.readwrite.graphml.GraphMLWriterLxml:
  - GraphMLWriter
  networkx.readwrite.graphml.IncrementalElement: []
  networkx.readwrite.text.AsciiBaseGlyphs:
  - BaseGlyphs
  networkx.readwrite.text.AsciiDirectedGlyphs:
  - AsciiBaseGlyphs
  networkx.readwrite.text.AsciiUndirectedGlyphs:
  - AsciiBaseGlyphs
  networkx.readwrite.text.BaseGlyphs: []
  networkx.readwrite.text.UtfBaseGlyphs:
  - BaseGlyphs
  networkx.readwrite.text.UtfDirectedGlyphs:
  - UtfBaseGlyphs
  networkx.readwrite.text.UtfUndirectedGlyphs:
  - UtfBaseGlyphs
  networkx.readwrite.text._parse_network_text.ParseStackFrame:
  - NamedTuple
  networkx.readwrite.text.generate_network_text.StackFrame:
  - NamedTuple
  networkx.utils.backends._LazyArgsRepr: []
  networkx.utils.backends._dispatchable: []
  networkx.utils.configs.BackendPriorities:
  - Config
  networkx.utils.configs.Config: []
  networkx.utils.configs.NetworkXConfig:
  - Config
  networkx.utils.decorators.argmap: []
  networkx.utils.heaps.BinaryHeap:
  - MinHeap
  networkx.utils.heaps.MinHeap: []
  networkx.utils.heaps.MinHeap._Item: []
  networkx.utils.heaps.PairingHeap:
  - MinHeap
  networkx.utils.heaps.PairingHeap._Node: []
  networkx.utils.mapped_queue.MappedQueue: []
  networkx.utils.mapped_queue._HeapElement: []
  networkx.utils.misc.PythonRandomInterface: []
  networkx.utils.misc.PythonRandomViaNumpyBits: []
  networkx.utils.union_find.UnionFind: []
ep:
  func_name: TestOneInput
  module: '...fuzz_graphml'
